Sciweavers

31 search results - page 6 / 7
» Fully homomorphic encryption using ideal lattices
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 11 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
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...
SP
2002
IEEE
141views Security Privacy» more  SP 2002»
13 years 7 months ago
Collaborative Filtering with Privacy
Server-based collaborative filtering systems have been very successful in e-commerce and in direct recommendation applications. In future, they have many potential applications in...
John F. Canny
TRUST
2010
Springer
14 years 18 days ago
Token-Based Cloud Computing
Secure outsourcing of computation to an untrusted (cloud) service provider is becoming more and more important. Pure cryptographic solutions based on fully homomorphic and verifia...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Marcel ...
SPW
2004
Springer
14 years 27 days ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson