Sciweavers

18 search results - page 3 / 4
» Implementing Two-Party Computation Efficiently with Security...
Sort
View
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
14 years 6 days ago
Secure Hamming Distance Based Computation and Its Applications
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
Ayman Jarrous, Benny Pinkas
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
13 years 9 months ago
Efficient Implementation of the Orlandi Protocol
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Niel...
IJACT
2008
83views more  IJACT 2008»
13 years 5 months ago
On the relation among various security models for certificateless cryptography
: Certificateless cryptography is a promising technology for solving the key escrow problem in identity-based cryptography. However, the lack of a unified set of definitions and se...
Qiong Huang, Duncan S. Wong
IACR
2011
101views more  IACR 2011»
12 years 5 months ago
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
Emil Stefanov, Elaine Shi, Dawn Song
CHES
2006
Springer
131views Cryptology» more  CHES 2006»
13 years 9 months ago
Why One Should Also Secure RSA Public Key Elements
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
Eric Brier, Benoît Chevallier-Mames, Mathieu...