Sciweavers

38 search results - page 3 / 8
» Random Oracles and Auxiliary Input
Sort
View
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
12 years 11 months ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...
PKC
2005
Springer
192views Cryptology» more  PKC 2005»
14 years 25 days ago
Securing RSA-KEM via the AES
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...
Jakob Jonsson, Matthew J. B. Robshaw
ASIACRYPT
2000
Springer
13 years 11 months ago
A Length-Invariant Hybrid Mix
This paper presents a secure and flexible Mix-net that has the following properties; it efficiently handles long plaintexts that exceed the modulus size of underlying public-key e...
Miyako Ohkubo, Masayuki Abe
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 8 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
EUROCRYPT
2007
Springer
14 years 1 months ago
Non-interactive Proofs for Integer Multiplication
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
Ivan Damgård, Rune Thorbek