Chosen ciphertext secure pseudorandom codes in the standard model
From MaRDI portal
Cites work
- A CCA2 Secure Variant of the McEliece Cryptosystem
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- A Polynomial-Time Attack on the BBCRS Scheme
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic cryptanalysis of McEliece variants with compact keys
- Algebraic Function Fields and Codes
- Attacking and Defending the McEliece Cryptosystem
- Augmented random oracles
- Breaking Goppa-based McEliece with hints
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- CryptAttackTester: high-assurance attack analysis
- Cryptographic primitives with hinting property
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- How Risky Is the Random-Oracle Model?
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 694889 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- More on average case vs approximation complexity
- On the (in)security of the Fiat-Shamir paradigm
- On the edge-independence number and edge-covering number for regular graphs
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Pseudorandom error-correcting codes
- Public-key encryption, local pseudorandom generators, and the low-degree method
- Quasilinear time list-decodable codes for space bounded channels
- Rate-1 incompressible encryption from standard assumptions
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
- Structural cryptanalysis of McEliece schemes with compact keys
- The syzygy distinguisher
- Weak keys in the McEliece public-key cryptosystem
This page was built for publication: Chosen ciphertext secure pseudorandom codes in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443211)