Reducing complexity assumptions for statistically-hiding commitment
From MaRDI portal
\textit{M. Naor} et al. [J. Cryptology 11, No. 2, 87--108 (1998; Zbl 0960.94016)] have shown how to construct statistically-hiding commitment schemes based on any one-way permutation. This paper discusses the construction with one-way functions for which the value of pre-images each of the outputs can be efficiently estimated. A special case is the class of regular one-way functions where all points in the image of the function have the same number of pre-images.
Recommendations
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- Statistically-hiding commitment from any one-way function
- Reducing Complexity Assumptions for Oblivious Transfer
- Concurrent non-malleable statistically hiding commitment
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Somewhere statistically binding commitment schemes with applications
- Non-malleable statistically hiding commitment from any one-way function
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- scientific article; zbMATH DE number 1024061
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A discrete logarithm implementation of perfect zero-knowledge blobs
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A Parallel Repetition Theorem
- A Pseudorandom Generator from any One-way Function
- Bit commitment using pseudorandomness
- Foundations of Cryptography
- Foundations of Cryptography
- How to construct constant-round zero-knowledge proof systems for NP
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- How to sign given any trapdoor permutation
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- scientific article; zbMATH DE number 177052 (Why is no real title available?)
- scientific article; zbMATH DE number 826071 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- Modern cryptography, probabilistic proofs and pseudo-randomness
- Necessary and sufficient conditions for collision-free hashing
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the Existence of Pseudorandom Generators
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- On the power of two-point based sampling
- Parallel coin-tossing and constant-round secure two-party computation
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Practical and provably-secure commitment schemes from collision-free hashing
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- Secure commitment against a powerful adversary
- Statistically-hiding commitment from any one-way function
- Universal classes of hash functions
Cited in
(12)- A new interactive hashing theorem
- 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
- Statistical secrecy and multibit commitments
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- 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
- Publicly-verifiable deletion via target-collapsing functions
- Weakening assumptions for publicly-verifiable deletion
- Publicly verifiable deletion: general compilers from minimal assumptions
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 Q1027978)
