Complexity Measures for Public-Key Cryptosystems
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (2), 309-335
- https://doi.org/10.1137/0217018
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- One-way functions and circuit complexityPublished by Springer Nature ,1986
- Qualitative relativizations of complexity classesJournal of Computer and System Sciences, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Relativized cryptographyIEEE Transactions on Information Theory, 1983
- A time-luck tradeoff in relativized cryptographyJournal of Computer and System Sciences, 1981
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- A note on the complexity of cryptography (Corresp.)IEEE Transactions on Information Theory, 1979
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975