Lifting standard model reductions to common setup assumptions
From MaRDI portal
Recommendations
Cites work
- A generalized birthday problem
- Analysis of information set decoding for a sub-linear error weight
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Breaking RSA may not be equivalent to factoring. (Extended abstract)
- Communication Theory of Secrecy Systems*
- Decoding one out of many
- Entity authentication and key distribution
- Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
- Finding collisions on a public road, or do secure hash functions need secret coins?
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- scientific article; zbMATH DE number 4172375 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Information-set decoding for linear codes over F_q
- Notions of black-box reductions, revisited
- On quantum slide attacks
- On tightly secure primitives in the multi-instance setting
- One-Time Programs
- Probabilistic encryption
- Random oracles in a quantum world
- Random oracles with(out) programmability
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Theory of Cryptography
- Transaction protection by beacons
- Universally composable commitments (extended abstract)
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
This page was built for publication: Lifting standard model reductions to common setup assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169031)