Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
From MaRDI portal
Recommendations
- Statistically-hiding commitment from any one-way function
- Reducing complexity assumptions for statistically-hiding commitment
- Statistical secrecy and multibit commitments
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- Non-malleable statistically hiding commitment from any one-way function
Cited in
(49)- Reducing complexity assumptions for statistically-hiding commitment
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Somewhere statistically binding commitment schemes with applications
- PKP-based signature scheme
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- On round optimal statistical zero knowledge arguments
- A new interactive hashing theorem
- Concurrent zero knowledge, revisited
- Quantum commitments from complexity assumptions
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- Quantum commitments from complexity assumptions
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
- Statistically-hiding commitment from any one-way function
- Which languages have 4-round zero-knowledge proofs?
- scientific article; zbMATH DE number 697825 (Why is no real title available?)
- scientific article; zbMATH DE number 1024061 (Why is no real title available?)
- Concurrent non-malleable statistically hiding commitment
- Statistical secrecy and multibit commitments
- scientific article; zbMATH DE number 2079922 (Why is no real title available?)
- Grid-obstacle representations with connections to staircase guarding
- The many entropies in one-way functions
- Message-restriction-free commitment scheme based on lattice assumption
- scientific article; zbMATH DE number 7250163 (Why is no real title available?)
- scientific article; zbMATH DE number 7286918 (Why is no real title available?)
- Inaccessible entropy
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- 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
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- An Equivalence Between Zero Knowledge and Commitments
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Statistical security in two-party computation revisited
- Doubly adaptive zero-knowledge proofs
- General properties of quantum bit commitments (extended abstract)
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Constant-round arguments from one-way functions
- Quantum advantage from one-way functions
- Resettable statistical zero-knowledge for NP
- Fair coin flipping: tighter analysis and the many-party case
- Generalized and unified equivalences between hardness and pseudoentropy
- Statistical zero knowledge and quantum one-way functions
- Constant-round adaptive zero-knowledge proofs for NP
This page was built for publication: Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575163)
