Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
From MaRDI portal
Publication:5117380
Recommendations
Cites work
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- Adaptive One-Way Functions and Applications
- Adaptive hardness and composable security in the plain model from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Black-box constructions of composable protocols without set-up
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent non-malleable commitments (and more) in 3 rounds
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Constant-round non-malleable commitments from sub-exponential one-way functions
- Formalizing human ignorance
- Four round secure computation without setup
- Four-round concurrent non-malleable commitments from one-way functions
- Identity-Based Encryption from the Weil Pairing
- New and improved constructions of non-malleable cryptographic protocols
- Non-interactive Zaps and New Techniques for NIZK
- Non-malleability amplification
- Non-malleable codes against bounded polynomial time tampering
- Nonmalleable Cryptography
- One-message zero knowledge and non-malleable commitments
- Resource fairness and composability of cryptographic protocols
- Round optimal concurrent non-malleability from polynomial hardness
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Round-efficient black-box construction of composable multi-party computation
- Textbook non-malleable commitments
- Theory of Cryptography
- Time-lock puzzles from randomized encodings
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited in
(26)- On non-uniform security for black-box non-interactive CCA commitments
- An Algebraic Approach to Nonmalleability
- One-message zero knowledge and non-malleable commitments
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Towards practical homomorphic time-lock puzzles: applicability and verifiability
- Round optimal concurrent non-malleability from polynomial hardness
- Non-malleable codes for bounded parallel-time tampering
- On the (im)possibility of time-lock puzzles in the quantum random oracle model
- Maliciously-secure MrNISC in the plain model
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Completeness theorems for adaptively secure broadcast
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Continuous verifiable delay functions
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Lattice-based timed cryptography
- Concurrently composable non-interactive secure computation
- COA-secure obfuscation and applications
- Non-malleable commitments against quantum attacks
- Black-box non-interactive non-malleable commitments
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- On the security of time-lock puzzles and timed commitments
- On the CCA compatibility of public-key infrastructure
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- A new approach to efficient non-malleable zero-knowledge
- Two-round maliciously secure computation with super-polynomial simulation
- Non-malleable time-lock puzzles and applications
This page was built for publication: Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117380)
