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