Sciweavers

947 search results - page 62 / 190
» Provable Implementations of Security Protocols
Sort
View
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai
FC
2010
Springer
196views Cryptology» more  FC 2010»
15 years 3 months ago
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers
IACR
2011
104views more  IACR 2011»
13 years 11 months ago
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, ...
WISA
2007
Springer
15 years 6 months ago
Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384, 512) for Hardware Implementations
Abstract. The hash algorithm forms the basis of many popular cryptographic protocols and it is therefore important to find throughput optimal implementations. Though there have be...
Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
ICALP
2005
Springer
15 years 5 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...