Preprint Non-Malleable Extractors and Codes, with their Many Tampered Extensions 2015 Chattopadhyay E, Goyal V, Li X
Chapter Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma 2015 • Lecture Notes in Computer Science • 9014:260-289 Goyal V, Lin H, Pandey O, Pass R, Sahai A
Chapter Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing 2014 • Lecture Notes in Computer Science • 8383:149-166 Ananth P, Chandran N, Goyal V, Kanukurthi B, Ostrovsky R
Conference An Algebraic Approach to Non-Malleabiliby 2014 41-50 Goyal V, Richelson S, Rosen A, Vald M
Conference Black-box non-black-box zero knowledge 2014 515-524 Goyal V, Ostrovsky R, Scafuro A, Visconti I
Chapter Interactive Proofs under Continual Memory Leakage 2014 • Lecture Notes in Computer Science • 8617:164-182 Ananth P, Goyal V, Pandey O
Chapter Lower Bounds in the Hardware Token Model 2014 • Lecture Notes in Computer Science • 8349:663-687 Agrawal S, Ananth P, Goyal V, Prabhakaran M, Rosen A
Chapter Multi-input Functional Encryption 2014 • Lecture Notes in Computer Science • 8441:578-602 Goldwasser S, Gordon SD, Goyal V, Jain A, Katz J, Liu F-H, Sahai A, Shi E, Zhou H-S
Journal Article Position-Based Cryptography 2014 • SIAM journal on computing (Print) • 43(4):1291-1341 Chandran N, Goyal V, Moriarty R, Ostrovsky R
Journal Article Position-Based Quantum Cryptography: Impossibility and Constructions 2014 • SIAM journal on computing (Print) • 43(1):150-178 Buhrman H, Chandran N, Fehr S, Gelles R, Goyal V, Ostrovsky R, Schaffner C
Chapter Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols 2013 • Lecture Notes in Computer Science • 8042:298-315 Goyal V, Mironov I, Pandey O, Sahai A
Chapter Concurrent Zero Knowledge in the Bounded Player Model 2013 • Lecture Notes in Computer Science • 7785:60-79 Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I
Chapter Constant-Round Concurrent Zero Knowledge in the Bounded Player Model 2013 • Lecture Notes in Computer Science • 8269:21-40 Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I
Chapter On Concurrently Secure Computation in the Multiple Ideal Query Model 2013 • Lecture Notes in Computer Science • 7881:684-701 Goyal V, Jain A
Chapter On the (In)security of Fischlin’s Paradigm 2013 • Lecture Notes in Computer Science • 7785:202-221 Ananth P, Bhaskar R, Goyal V, Rao V
Chapter What Information Is Leaked under Concurrent Composition? 2013 • Lecture Notes in Computer Science • 8043:220-238 Goyal V, Gupta D, Jain A
Chapter Concurrently Secure Computation in Constant Rounds 2012 • Lecture Notes in Computer Science • 7237:99-116 Garg S, Goyal V, Jain A, Sahai A
Conference Constructing Non-Malleable Commitments: A Black-Box Approach 2012 51-60 Goyal V, Lee C-K, Ostrovsky R, Visconti I
Chapter New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation 2012 • Lecture Notes in Computer Science • 7417:443-460 Agrawal S, Goyal V, Jain A, Prabhakaran M, Sahai A
Chapter On Black-Box Reductions between Predicate Encryption Schemes 2012 • Lecture Notes in Computer Science • 7194:440-457 Goyal V, Kumar V, Lokam S, Mahmoody M
Chapter On-Line/Off-Line Leakage Resilient Secure Computation Protocols 2012 • Lecture Notes in Computer Science • 7668:100-119 Ganesh C, Goyal V, Lokam S
Conference Positive Results for Concurrently Secure Computation in the Plain Model 2012 41-50 Goyal V
Chapter Bringing People of Different Beliefs Together to Do UC 2011 • Lecture Notes in Computer Science • 6597:311-328 Garg S, Goyal V, Jain A, Sahai A
