Sciweavers

CRYPTO
2010
Springer
121views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
Anindya De, Luca Trevisan, Madhur Tulsiani
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
CRYPTO
2010
Springer
144views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Structure-Preserving Signatures and Commitments to Group Elements
Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristi...
CRYPTO
2010
Springer
141views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Factorization of a 768-Bit RSA Modulus
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Ar...
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
CRYPTO
2010
Springer
228views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
On Generalized Feistel Networks
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
Viet Tung Hoang, Phillip Rogaway