Relativized cryptography
From MaRDI portal
Publication:3689089
DOI10.1109/TIT.1983.1056754zbMath0571.94011OpenAlexW2294439931MaRDI QIDQ3689089
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1983.1056754
computational securityrelativized model of computationcomputable oraclelength-preserving permutationsecurity against chosen-plaintext attackstransient-key cryptography
Related Items
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \), On basing search SIVP on \(\mathbf{NP}\)-hardness, The Journey from NP to TFNP Hardness, One-way functions and circuit complexity, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, New hash functions and their use in authentication and set equality, Cryptographic transformations of non-Shannon sources of information, A time-luck tradeoff in relativized cryptography, Structure Versus Hardness Through the Obfuscation Lens, Two phases encryption and its applications, A new password authentication mechanism based on two phases encryption, On Basing Private Information Retrieval on NP-Hardness, Probabilistic encryption
