Sciweavers

341 search results - page 40 / 69
» Deniable Functional Encryption
Sort
View
ASIACRYPT
2006
Springer
15 years 2 months ago
On the Security of OAEP
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
Alexandra Boldyreva, Marc Fischlin
INDOCRYPT
2005
Springer
15 years 4 months ago
On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
Prouff has introduced recently, at FSE 2005, the notion of transparency order of S-boxes. This new characteristic is related to the ability of an S-box, used in a cryptosystem in ...
Claude Carlet
PAIRING
2010
Springer
179views Cryptology» more  PAIRING 2010»
14 years 9 months ago
Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hy...
Pierre-Alain Fouque, Mehdi Tibouchi
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
15 years 11 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
CCS
2005
ACM
15 years 4 months ago
Obfuscated databases and group privacy
We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conve...
Arvind Narayanan, Vitaly Shmatikov