Treffer: The all-or-nothing nature of two-party secure computation
Title:
The all-or-nothing nature of two-party secure computation
Source:
CRYPTO '99 : advances in cryptology (Santa Barbara CA, 15-19 August 1999)Lecture notes in computer science. :80-97
Publisher Information:
Berlin: Springer, 1999.
Publication Year:
1999
Physical Description:
print, 1 p.1/4
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Cryptographie, Cryptography, Criptografía, Sécurité, Safety, Seguridad, Traitement informatique, Computerized processing, Tratamiento informático
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Division of Engineering and Applied Sciences, Harvard University, 40 Oxford st., Cambridge, MA 02138, United States
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology sq., Cambridge, MA 02139, United States
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology sq., Cambridge, MA 02139, United States
ISSN:
0302-9743
Rights:
Copyright 1999 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.1825076
Database:
PASCAL Archive
Weitere Informationen
A function f is computationally securely computable if two computationally-bounded parties Alice, having a secret input x, and Bob, having a secret input y1 can talk back and forth so that (even if one of them is malicious) (1) Bob learns essentially only f(x,y) while (2) Alice learns essentially nothing. We prove that, if any non-trivial function can be so computed, then so can every function. Consequently, the complexity assumptions sufficient and/or required for computationally securely computing f are the same for every non-trivial function f.