Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
From MaRDI portal
Publication:3452352
DOI10.1007/3-540-68697-5_16zbMath1329.94061OpenAlexW1514617528MaRDI QIDQ3452352
Publication date: 11 November 2015
Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68697-5_16
Related Items
Concurrent knowledge extraction in public-key models ⋮ On the security of joint signature and encryption revisited ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ Efficient unique ring signatures from lattices ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ 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 ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial ⋮ Verifiability-based conversion from CPA to CCA-secure predicate encryption ⋮ Efficient non-malleable commitment schemes ⋮ Efficient non-malleable commitment schemes ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Robust random number generation for peer-to-peer systems ⋮ On the power of secure two-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ On the CCA compatibility of public-key infrastructure ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Unnamed Item ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries
Cites Work
