On the existence of statistically hiding bit commitment schemes and fail-stop signatures
From MaRDI portal
Publication:1364901
DOI10.1007/S001459900026zbMath0899.94011OpenAlexW2080137555MaRDI QIDQ1364901
Birgit Pfitzmann, Ivan B. Damgård, Torben P. Pedersen
Publication date: 28 August 1997
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900026
Related Items (11)
Parallel Hashing via List Recoverability ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Concurrent non-malleable statistically hiding commitment ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Security of blind signatures under aborts and applications to adaptive oblivious transfer ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum disclosure proofs of knowledge
- Universal classes of hash functions
- Digital signature schemes: general framework and fail-stop signatures
- Privacy Amplification by Public Discussion
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- The Knowledge Complexity of Interactive Proof Systems
- New directions in cryptography
- The Wire-Tap Channel
- Fail-Stop Signatures
- Statistical secrecy and multibit commitments
- RIPEMD-160: A strengthened version of RIPEMD
- Generalized privacy amplification
This page was built for publication: On the existence of statistically hiding bit commitment schemes and fail-stop signatures
