A Generalized Encryption Scheme Based on Random Graphs

A probabilistic encryption scheme is generalized in such a way that an encryption is sometimes ambiguous (the same object might be an encryption of both 0 and 1), but a probability of this event is very low. Such a generalization is sufficient for a large number of applications.

[1]  László Babai,et al.  Canonical labelling of graphs in linear average time , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[4]  Yacov Yacobi,et al.  Cryptocomplexity and NP-Completeness , 1980, ICALP.

[5]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..