Sciweavers

860 search results - page 18 / 172
» Completeness in two-party secure computation: a computationa...
Sort
View
EUROCRYPT
2004
Springer
15 years 9 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
EUROCRYPT
2007
Springer
16 years 6 days ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
COMPSAC
2011
IEEE
14 years 5 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...
SIGCSE
2008
ACM
365views Education» more  SIGCSE 2008»
15 years 6 months ago
Computer science olympiad: exploring computer science through competition
Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
Iretta B. C. Kearse, Charles Hardnett
ASIACRYPT
2008
Springer
15 years 8 months ago
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
Goichiro Hanaoka, Kaoru Kurosawa