Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
From MaRDI portal
Publication:3600238
DOI10.1007/978-3-540-85174-5_29zbMath1183.94030OpenAlexW1887013885MaRDI QIDQ3600238
Shabsi Walfish, Victor Shoup, Yevgeniy Dodis
Publication date: 10 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_29
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items
New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications ⋮ The wonderful world of global random oracles ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Witness-succinct universally-composable SNARKs ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Identity-based trapdoor mercurial commitments and applications ⋮ Signatures from sequential-OR proofs