Efficient non-malleable commitment schemes
From MaRDI portal
Recommendations
Cites work
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - EUROCRYPT 2004
- Bit commitment using pseudorandomness
- Completely non-malleable schemes (extended abstract)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient and non-interactive non-malleable commitment
- Efficient non-malleable commitment schemes
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Finding smooth integers in short intervals using CRT decoding
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Ideal error-correcting codes: Unifying algebraic and number-theoretic algorithms
- Minimum disclosure proofs of knowledge
- Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks
- Mutually independent commitments
- New notions of security: achieving universal composability without trusted setup
- Non-interactive and information-theoretic secure verifiable secret sharing
- Non-interactive and reusable non-malleable commitment schemes
- Nonmalleable Cryptography
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Optimal asymmetric encryption
- Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
- Practical and provably-secure commitment schemes from collision-free hashing
- Resettable zero-knowledge (extended abstract)
- Selecting cryptographic key sizes
- Session-key generation using human passwords only
- The representation problem based on factoring
- Universally composable commitments (extended abstract)
- Universally composable two-party and multi-party secure computation
- Zero-knowledge proofs of identity
Cited in
(13)- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- Non-malleability vs. CCA-security: the case of commitments
- More efficient commitments from structured lattice assumptions
- Non-malleable vector commitments via local equivocability
- Efficient and non-interactive non-malleable commitment
- Non-interactive and reusable non-malleable commitment schemes
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- Universal Accumulators with Efficient Nonmembership Proofs
- Efficient non-malleable commitment schemes
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Theory of Cryptography
- Efficient non-malleable commitment schemes
This page was built for publication: Efficient non-malleable commitment schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902225)
