Reducing Complexity Assumptions for Statistically-Hiding Commitment

DOI10.1007/11426639_4MaRDI QIDQ5385722zbMATH OpenOpenAlexFDO

Authors Iftach Haitner, Omer Horvitz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel, Jonathan 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)

Recommendations

• Reducing complexity assumptions for statistically-hiding commitment
• Construction and application of a perfectly hiding commitment scheme based on one-way functions
• Statistically-hiding commitment from any one-way function
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

Cited in

(11)

• Hybrid commitments and their applications to zero-knowledge proof systems
• Reducing complexity assumptions for statistically-hiding commitment
• Concurrent knowledge extraction in public-key models
• Secrecy without perfect randomness: cryptography with (bounded) weak sources
• Statistically-hiding commitment from any one-way function
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• scientific article; zbMATH DE number 4096780 (Why is no real title available?)
• Statistical secrecy and multibit commitments
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Construction and application of a perfectly hiding commitment scheme based on one-way functions
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)

This page was built for publication: Reducing Complexity Assumptions for Statistically-Hiding Commitment

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