Triply adaptive UC NIZK
From MaRDI portal
Publication:6132421
DOI10.1007/978-3-031-22966-4_16zbMath1519.94071OpenAlexW4320154830MaRDI QIDQ6132421
Pratik Sarkar, Ran Canetti, Xiao Wang
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_16
Related Items (2)
Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- A proof of security of Yao's protocol for two-party computation
- Compact NIZKs from standard assumptions on bilinear maps
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Composition with knowledge assumptions
- Non-interactive batch arguments for NP from standard assumptions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Exploring constructions of compact NIZKs from various assumptions
- Enhancements of trapdoor permutations
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- On the Power of Secure Two-Party Computation
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Universally composable two-party and multi-party secure computation
- Perfect Non-interactive Zero Knowledge for NP
- Perfect NIZK with Adaptive Soundness
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Noninteractive Zero-Knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Fiat-Shamir: from practice to theory
- New Techniques for Noninteractive Zero-Knowledge
- Online/Offline OR Composition of Sigma Protocols
- Theory of Cryptography
- Adaptively secure MPC with sublinear communication complexity
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Reverse firewalls for adaptively secure MPC without setup
This page was built for publication: Triply adaptive UC NIZK
