• Publications
  • Influence
Probabilistic Encryption
It is proved that extracting any information about the cleartext from the cyphertext is hard on the average for an adversary with polynomially bounded computational resources. Expand
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message. Expand
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Every function of <italic>n</italic> inputs can be efficiently computed by a complete network of <italic>n</italic> processors in such a way that:<list><item>If no faults occur, no set of sizeExpand
How to construct random functions
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented that has applications in cryptography, random constructions, and complexity theory. Expand
Property testing and its connection to learning and approximation
This paper considers the question of determining whether a function f has property P or is ε-far from any function with property P, and devise algorithms to test whether the underlying graph has properties such as being bipartite, k-Colorable, or having a clique of density p-Clique with respect to the vertex set. Expand
The knowledge complexity of interactive proof-systems
Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage. rhe ACM copyright notice and the title ofExpand
The Knowledge Complexity of Interactive Proof Systems
A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity. Expand
Public-Key Cryptosystems from Lattice Reduction Problems
A new proposal for a trapdoor one-way function, from which the security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS. Expand
Machine Learning Classification over Encrypted Data
A new library of building blocks is constructed, which enables constructing a wide range of privacy-preserving classifiers and it is demonstrated how this library can be used to construct other classifiers than the three mentioned above, such as a multiplexer and a face detection classifier. Expand