On non-uniform security for black-box non-interactive CCA commitments

Cites Work

Practical and provably-secure commitment schemes from collision-free hashing
Title not available (Why is that?)
Constant-round non-malleable commitments from any one-way function
Derandomization in Cryptography
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Constant-round non-malleable commitments from sub-exponential one-way functions
New and improved constructions of non-malleable cryptographic protocols
Adaptive One-Way Functions and Applications
Title not available (Why is that?)
Non-malleability amplification
Constant round non-malleable protocols using one way functions
Concurrent Non-malleable Commitments from Any One-Way Function
New and Improved Constructions of Nonmalleable Cryptographic Protocols
Random Oracles and Auxiliary Input
Multi-collision resistance: a paradigm for keyless hash functions
On non-black-box simulation and the impossibility of approximate obfuscation
New techniques for noninteractive zero-knowledge
One-message zero knowledge and non-malleable commitments
\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Four-round concurrent non-malleable commitments from one-way functions
Four round secure computation without setup
Round optimal concurrent MPC via strong simulation
Round optimal concurrent non-malleability from polynomial hardness
Non-malleability vs. CCA-security: the case of commitments
Promise zero knowledge and its applications to round optimal MPC
Adaptive hardness and composable security in the plain model from standard assumptions
Concurrent non-malleable commitments (and more) in 3 rounds
Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
Textbook non-malleable commitments
Round optimal secure multiparty computation from minimal assumptions
Round-optimal secure multi-party computation
A new approach to round-optimal secure multiparty computation
Black-box non-interactive non-malleable commitments
Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
Non-interactive non-malleability from quantum supremacy
Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
An Algebraic Approach to Nonmalleability
New constructions of hinting PRGs, OWFs with encryption, and more

This page was built for publication: On non-uniform security for black-box non-interactive CCA commitments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138083)