Probabilistic encryption: theory and applications
A new probabilistic model of data encryption is introduced. For this model, under suitable complexity assumptions, it is proved that extracting any information about messages from their encodings is difficult on the average for an adversary with polynomially bounded computational resources. This security holds for any message space with any probability distribution. The author provides a formal model of a public key cryptosystem and introduces a formal definition of security for such systems. The security definition guarantees that no passive eavesdropper will have even a moderate success in distinguishing between any two encrypted messages. The probabilistic encryption model achieves this security criterion. Two concrete implementations of the model are presented. The first is secure under the assumption that factoring is intractable. The second is secure under the assumption that it is intractable to decide whether numbers are quadratic residues modulo a composite number whose factorization is unknown. Two trapdoor number theoretic boolean predicates are introduced: the Quadratic Residuosity predicate and the Factoring predicate. Finally, a method is presented for generating a pseudo random sequence of bits that are as hard to predict as it is to factor large composite numbers.
- Research Organization:
- California Univ., Berkeley (USA)
- OSTI ID:
- 5493394
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Incoercible multiparty computation
Key management for large scale end-to-end encryption