Sciweavers

62 search results - page 8 / 13
» Multiparty Computation from Threshold Homomorphic Encryption
Sort
View
TCC
2012
Springer
240views Cryptology» more  TCC 2012»
12 years 2 months ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
CMS
2011
229views Communications» more  CMS 2011»
12 years 7 months ago
Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
SCN
2008
Springer
13 years 7 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
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