Efficient adaptively secure zero-knowledge from garbled circuits
From MaRDI portal
Publication:1753863
DOI10.1007/978-3-319-76581-5_17zbMath1420.94066OpenAlexW2793916198MaRDI QIDQ1753863
Yashvanth Kondi, Pratik Sarkar, Chaya Ganesh, Arpita Patra
Publication date: 29 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_17
Related Items (7)
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ On the power of secure two-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ (Commit-and-prove) predictable arguments with privacy ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
This page was built for publication: Efficient adaptively secure zero-knowledge from garbled circuits
