GUC-secure commitments via random oracles: new impossibility and feasibility
From MaRDI portal
Publication:6175972
DOI10.1007/978-3-031-22972-5_5zbMath1519.94208OpenAlexW4317928324MaRDI QIDQ6175972
Zhelei Zhou, Hong-Sheng Zhou, Bingsheng Zhang, Kui Ren
Publication date: 21 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-22972-5_5
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-round MPC: information-theoretic and black-box
- The wonderful world of global random oracles
- Efficient adaptively secure zero-knowledge from garbled circuits
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Towards non-interactive witness hiding
- Insured MPC: efficient secure computation with financial penalties
- Scalable zero knowledge with no trusted setup
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Quantum Communication Attacks on Classical Cryptographic Protocols
- Universally Composable Security with Global Setup
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Sublinear Zero-Knowledge Arguments for RAM Programs
- Theory of Cryptography
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
This page was built for publication: GUC-secure commitments via random oracles: new impossibility and feasibility
