Share This Author
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- S. Goldwasser, S. Micali, R. Rivest
- Computer Science, MathematicsSIAM journal on computing (Print)
- 1 April 1988
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.
The knowledge complexity of interactive proof-systems
- S. Goldwasser, S. Micali, C. Rackoff
- Mathematics, Computer ScienceSymposium on the Theory of Computing
- 1 December 1985
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.
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 size…
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.
Property testing and its connection to learning and approximation
- Oded Goldreich, S. Goldwasser, D. Ron
- Computer ScienceProceedings of 37th Conference on Foundations of…
- 14 October 1996
The authors study the question of determining whether an unknown function has a particular property or is /spl epsiv/-far from any function with that property, and devise algorithms to test whether a graph has properties such as being k-colorable or having a /spl rho/-clique.
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
Machine Learning Classification over Encrypted Data
- Raphael Bost, R. A. Popa, Stephen Tu, S. Goldwasser
- Computer ScienceNetwork and Distributed System Security Symposium
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.
Public-Key Cryptosystems from Lattice Reduction Problems
- Oded Goldreich, S. Goldwasser, S. Halevi
- Computer Science, MathematicsAnnual International Cryptology Conference
- 1 November 1996
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.
Probabilistic encryption & how to play mental poker keeping secret all partial information
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the…