Efficient adaptively secure zero-knowledge from garbled circuits

DOI10.1007/978-3-319-76581-5_17MaRDI QIDQ1753863zbMATH OpenOpenAlexFDO

Authors Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar

Publication date 29 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76581-5_17

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Adaptively secure garbled circuits from one-way functions
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• scientific article; zbMATH DE number 1256783
• Adaptively indistinguishable garbled circuits
• Threshold garbled circuits and ad hoc secure computation
• Adaptive security of practical garbling schemes
• Concurrent non-malleable zero knowledge with adaptive inputs

Cited in

(18)

• (Commit-and-prove) predictable arguments with privacy
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Secure multiparty computation with identifiable abort via vindicating release
• A new approach to garbled circuits
• Adaptive garbled RAM from laconic oblivious transfer
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• GUC-secure commitments via random oracles: new impossibility and feasibility
• Adaptively secure garbling with near optimal online complexity
• Adaptively secure MPC with sublinear communication complexity
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• On the power of secure two-party computation
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
• Round efficient Byzantine agreement from VDFs

This page was built for publication: Efficient adaptively secure zero-knowledge from garbled circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753863)