Practical and provably-secure commitment schemes from collision-free hashing
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 176568 (Why is no real title available?)
- scientific article; zbMATH DE number 177054 (Why is no real title available?)
- scientific article; zbMATH DE number 503241 (Why is no real title available?)
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 1024061 (Why is no real title available?)
- scientific article; zbMATH DE number 1030983 (Why is no real title available?)
- scientific article; zbMATH DE number 1394323 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- Universal classes of hash functions
Cited in
(45)- Robust random number generation for peer-to-peer systems
- Hybrid commitments and their applications to zero-knowledge proof systems
- Reducing complexity assumptions for statistically-hiding commitment
- Black-box non-interactive non-malleable commitments
- On the CCA compatibility of public-key infrastructure
- On the complexity of collision resistant hash functions: new and old black-box separations
- Continuously non-malleable secret sharing for general access structures
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- On the power of secure two-party computation
- Two-party ECDSA from hash proof systems and efficient instantiations
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- A new interactive hashing theorem
- Concurrent knowledge extraction in public-key models
- Collapse-binding quantum commitments without random oracles
- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- Efficient string-commitment from weak bit-commitment
- Private coins versus public coins in zero-knowledge proof systems
- Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More
- On the security of joint signature and encryption revisited
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- Which languages have 4-round zero-knowledge proofs?
- scientific article; zbMATH DE number 1030983 (Why is no real title available?)
- Low-complexity cryptographic hash functions
- Efficient non-malleable commitment schemes
- Efficient non-malleable commitment schemes
- Efficient unique ring signatures from lattices
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Doubly adaptive zero-knowledge proofs
- On non-uniform security for black-box non-interactive CCA commitments
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- That's not my signature! Fail-stop signatures for a post-quantum world
- Quantum advantage from one-way functions
- Black-box (and fast) non-malleable zero knowledge
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- How to share an NP statement or combiners for zero-knowledge proofs
- Black-box constant-round secure 2PC with succinct communication
- Zero-knowledge RAM: doubly efficient and black-box
- Re-randomize and extract: a novel commitment construction framework based on group actions
- On the black-box complexity of correlation intractability
- Black-box timed commitments from time-lock puzzles
- Four-round statistical non-malleable zero-knowledge
- On the cryptographic futility of non-collapsing measurements
This page was built for publication: Practical and provably-secure commitment schemes from collision-free hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452352)
