Limits of provable security from standard assumptions

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60)

Recommendations

On the security loss of unique signatures
Impossibility of the provable security of the Schnorr signature from the one-more DL assumption in the non-programmable random oracle model
Towards non-black-box lower bounds in cryptography
On the Security Loss in Cryptographic Reductions
Unprovable security of perfect NIZK and non-interactive non-malleable commitments

Cited in

(35)

On the security loss of unique signatures
The hunting of the SNARK
Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
Impossibility on tamper-resilient cryptography with uniqueness properties
On selective-opening security of deterministic primitives
Black-box use of one-way functions is useless for optimal fair coin-tossing
Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
Counterexamples to new circular security assumptions underlying iO
Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
Individual simulations
On the adaptive security of MACs and PRFs
Lower bounds on assumptions behind indistinguishability obfuscation
Cryptographic assumptions: a position paper
Black-box separations for one-more (static) CDH and its generalization
Towards non-black-box separations of public key encryption and one way function
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Limits of Constructive Security Proofs
Another Look at “Provable Security”. II
Constructing tree decompositions of graphs with bounded gonality
The One-More Discrete Logarithm Assumption in the Generic Group Model
Non-interactive blind signatures for random messages
Rai-Choo! Evolving blind signatures to the next level
Practical round-optimal blind signatures in the ROM from standard assumptions
Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
New limits of provable security and applications to ElGamal encryption
On the unforgeability of the Chaum-Pedersen blind signature scheme
Pairing-free blind signatures from standard assumptions in the ROM
Limits on adaptive security for attribute-based encryption
Practical blind signatures in pairing-free groups
Tightly-secure blind signatures in pairing-free groups
On the limits of non-interactive blind signatures
New limits for homomorphic encryption
Four-round statistical non-malleable zero-knowledge
On non-interactive blind signatures in the plain model using complexity leveraging
A note on the minimality of one-way functions in post-quantum cryptography

This page was built for publication: Limits of provable security from standard assumptions

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