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

Cites Work

Unnamed Item
Unnamed Item
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
One-message zero knowledge and non-malleable commitments
\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
A new approach to round-optimal secure multiparty computation
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
Black-box non-interactive non-malleable commitments
Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
New constructions of hinting PRGs, OWFs with encryption, and more
Round optimal secure multiparty computation from minimal assumptions
Non-interactive non-malleability from quantum supremacy
Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
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
Random Oracles and Auxiliary Input
New and Improved Constructions of Nonmalleable Cryptographic Protocols
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
An Algebraic Approach to Nonmalleability
Non-malleability amplification
Multi-collision resistance: a paradigm for keyless hash functions
Textbook non-malleable commitments
Derandomization in Cryptography
New Techniques for Noninteractive Zero-Knowledge
Constant round non-malleable protocols using one way functions
Constant-round non-malleable commitments from any one-way function
Concurrent Non-malleable Commitments from Any One-Way Function
Round-optimal secure multi-party computation