Relativized cryptography
From MaRDI portal
Recommendations
Cited in
(18)- One-way functions and circuit complexity
- On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth
- scientific article; zbMATH DE number 708821 (Why is no real title available?)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- New hash functions and their use in authentication and set equality
- On basing search SIVP on \(\mathbf{NP}\)-hardness
- On basing private information retrieval on NP-hardness
- scientific article; zbMATH DE number 169207 (Why is no real title available?)
- The journey from NP to TFNP hardness
- NP completeness of relocation cipher
- Cryptographic transformations of non-Shannon sources of information
- A new password authentication mechanism based on two phases encryption
- A time-luck tradeoff in relativized cryptography
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Structure versus hardness through the obfuscation lens
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Probabilistic encryption
- Two phases encryption and its applications
This page was built for publication: Relativized cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689089)
