Statistical zapr arguments from bilinear maps by Lombardi, Alex, Vaikuntanathan, Vinod, Wichs, Daniel

“…Our construction relies on a combination of several tools, including the Groth-Ostrovsky-Sahai NIZK and NIWI [EUROCRYPT ’06, CRYPTO ’06, JACM ’12], “sometimes-binding statistically hiding commitments” [Kalai-Khurana-Sahai, EUROCRYPT ’18] and the “MPC-in-the-head” technique [Ishai-Kushilevitz-Ostrovsky-Sahai, STOC ’07].…”
Get full text

Towards breaking the exponential barrier for general secret sharing by Liu, Tianren, Vaikuntanathan, Vinod, Wee, Hoeteck

Get full text

Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs by Lombardi, Alex, Vaikuntanathan, Vinod

“…As a corollary (following Choudhuri et al., ePrint 2019 and Ephraim et al., EUROCRYPT 2020), we construct hard-on-average problems in the complexity class (Formula Presented) under the (Formula Presented)-hardness of the repeated squaring problem and the (Formula Presented)-hardness of the learning with errors problem. …”
Get full text

Formalizing Data Deletion in the Context of the Right to Be Forgotten by Goldwasser, Shafrira, Vasudevan, Prashant

Get full text

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits by Boneh, Dan, Gentry, Craig, Gorbunov, Sergey, Halevi, Shai, Nikolaenko, Valeria, Segev, Gil, Vaikuntanathan, Vinod, Vinayagamurthy, Dhinakaran

Get full text
Get full text

Leveled Fully Homomorphic Signatures from Standard Lattices by Gorbunov, Sergey, Vaikuntanathan, Vinod, Wichs, Daniel

“…(CRYPTO '13) and Boneh et al. (EUROCRYPT '14) in the contexts of fully homomorphic and attribute-based encryptions.…”
Get full text
Get full text