Sciweavers

321 search results - page 19 / 65
» Secure Multiparty Computation of Approximations
Sort
View
152
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
15 years 10 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
EUROCRYPT
2005
Springer
15 years 9 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
ASIACRYPT
2009
Springer
15 years 10 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
ESORICS
2010
Springer
15 years 4 months ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh