Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shashank Agrawal
2010 – today
- 2012
[j1]Shashank Agrawal: Verifiable secret sharing in a total of three rounds. Inf. Process. Lett. 112(22): 856-859 (2012)- [c4]Abhinav Mehta, Shashank Agrawal, Kannan Srinathan: Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission. ICDCN 2012: 138-152
- 2011
- [c3]Manan Nayak, Shashank Agrawal, Kannan Srinathan: Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks. ICITS 2011: 32-51
- [c2]Shashank Agrawal, Abhinav Mehta, Kannan Srinathan: Secure Message Transmission in Asynchronous Directed Graphs. INDOCRYPT 2011: 359-378
- [i4]Shashank Agrawal, Abhinav Mehta, Kannan Srinathan: Secure Message Transmission In Asynchronous Directed Networks. IACR Cryptology ePrint Archive 2011: 13 (2011)
- [i3]Shashank Agrawal, Abhinav Mehta, Kannan Srinathan: Unconditionally Reliable Message Transmission in Directed Neighbour Networks. IACR Cryptology ePrint Archive 2011: 14 (2011)
- [i2]Manan Nayak, Shashank Agrawal, Kannan Srinathan: Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks. IACR Cryptology ePrint Archive 2011: 320 (2011)
- 2010
- [c1]Abhinav Mehta, Shashank Agrawal, Kannan Srinathan: Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT. DISC 2010: 201-203
- [i1]Abhinav Mehta, Shashank Agrawal, Kannan Srinathan: Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission. IACR Cryptology ePrint Archive 2010: 392 (2010)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:15 CET by the dblp team