GUC-secure commitments via random oracles: new impossibility and feasibility

DOI10.1007/978-3-031-22972-5_5MaRDI QIDQ6175972zbMATH OpenOpenAlexFDO

Authors Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, 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

zbMATH Keywords

minicrypt assumptionsround-optimal GUC-secure commitment

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• Generic construction of GUC secure commitment in the KRK model
• On the complexity of UC commitments
• Theory of Cryptography
• The wonderful world of global random oracles

Cites work

• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Efficient adaptively secure zero-knowledge from garbled circuits
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Insured MPC: efficient secure computation with financial penalties
• Introduction to modern cryptography.
• Quantum communication attacks on classical cryptographic protocols. (Invited talk)
• Scalable zero knowledge with no trusted setup
• Sublinear zero-knowledge arguments for RAM programs
• The Knowledge Complexity of Interactive Proof Systems
• The wonderful world of global random oracles
• Theory of Cryptography
• Towards non-interactive witness hiding
• Two-round MPC: information-theoretic and black-box
• Universally composable -protocols in the global random-oracle model
• Universally Composable Security with Global Setup

Cited in

(5)

• A note on the feasibility of generalised universal composability
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• Generic construction of GUC secure commitment in the KRK model
• A Note on the Feasibility of Generalized Universal Composability
• Endemic oblivious transfer via random oracles, revisited

This page was built for publication: GUC-secure commitments via random oracles: new impossibility and feasibility

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