The Notion of Security for Probabilistic Cryptosystems
Authors:
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (2) , 412-426
Abstract
Three very different formal definitions of security for public-key cryptosystems have been proposed—two by Goldwasser and Micali and one by Yao. We prove all of them to be equivalent. This equivalence provides evidence that the right formalization of the notion of security has been reached.Keywords
This publication has 12 references indexed in Scilit:
- Verifiable secret sharing and achieving simultaneity in the presence of faults1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Theory and application of trapdoor functions1982
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949