172 search results - page 18 / 35 » Black-Box Constructions of Protocols for Secure Computation |
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
ICICS
2009
Springer
14 years 2 months ago
2009
Springer
Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works o...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
SEC
2001
13 years 9 months ago
2001
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...