Statistically-hiding commitment from any one-way function

zbMATH Open1232.68043MaRDI QIDQ3549591FDOQ3549591

Authors: Iftach Haitner, Omer Reingold 

Publication date: 5 January 2009

Recommendations

• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Reducing Complexity Assumptions for Statistically-Hiding Commitment
• Reducing complexity assumptions for statistically-hiding commitment
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
• Concurrent non-malleable statistically hiding commitment

zbMATH Keywords

one-way functiontwo-phase commitment schemes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (24)

• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
• Title not available (Why is that?)
• Computational hardness of optimal fair computation: beyond Minicrypt
• Concurrent knowledge extraction in public-key models
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Reducing Complexity Assumptions for Statistically-Hiding Commitment
• An Equivalence Between Zero Knowledge and Commitments
• The Complexity of Zero Knowledge
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Possibility and impossibility results for selective decommitments
• Long-term security and universal composability
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Reducing complexity assumptions for statistically-hiding commitment
• Non-malleable statistically hiding commitment from any one-way function
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• Magic adversaries versus individual reduction: science wins either way
• Short zero-knowledge proof of knowledge for lattice-based commitment
• That's not my signature! Fail-stop signatures for a post-quantum world
• Construction and application of a perfectly hiding commitment scheme based on one-way functions
• Title not available (Why is that?)
• A new interactive hashing theorem
• Black-box use of one-way functions is useless for optimal fair coin-tossing
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

This page was built for publication: Statistically-hiding commitment from any one-way function

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