Sciweavers

712 search results - page 13 / 143
» A Study on the Security of Privacy Homomorphism
Sort
View
FC
2010
Springer
196views Cryptology» more  FC 2010»
14 years 10 days 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
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 10 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
SOUPS
2006
ACM
14 years 2 months ago
An empirical study of natural language parsing of privacy policy rules using the SPARCLE policy workbench
Today organizations do not have good ways of linking their written privacy policies with the implementation of those policies. To assist organizations in addressing this issue, ou...
Carolyn Brodie, Clare-Marie Karat, John Karat
SOUPS
2009
ACM
14 years 2 months ago
Serial hook-ups: a comparative usability study of secure device pairing methods
Secure Device Pairing is the bootstrapping of secure communication between two previously unassociated devices over a wireless channel. The human-imperceptible nature of wireless ...
Alfred Kobsa, Rahim Sonawalla, Gene Tsudik, Ersin ...
IEEEARES
2007
IEEE
14 years 2 months ago
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
Orhan Cetinkaya, Ali Doganaksoy