Sciweavers

146 search results - page 11 / 30
» Homomorphic encryption from codes
Sort
View
EUROCRYPT
1999
Springer
13 years 12 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
CSE
2009
IEEE
14 years 2 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
ICISC
2004
173views Cryptology» more  ICISC 2004»
13 years 9 months ago
On Private Scalar Product Computation for Privacy-Preserving Data Mining
In mining and integrating data from multiple sources, there are many privacy and security issues. In several different contexts, the security of the full privacy-preserving data mi...
Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mi...
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
13 years 11 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar