Reducing Complexity Assumptions for Statistically-Hiding Commitment

DOI10.1007/11426639_4zbMath1137.94345OpenAlexW1597591185MaRDI QIDQ5385722

Chiu-Yuen Koo, Ruggero Morselli, Omer Horvitz, Ronen Shaltiel, Iftach Haitner, Jonathan N. Katz

Publication date: 6 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11426639_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Concurrent knowledge extraction in public-key models, Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources, Hybrid commitments and their applications to zero-knowledge proof systems, Reducing complexity assumptions for statistically-hiding commitment, Interactive Hashing: An Information Theoretic Tool (Invited Talk), Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments