66 search results - page 10 / 14 » crypto 2009 |
117
Voted
CANS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
123
click to vote
AAECC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
101
click to vote
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
120
Voted
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
164
click to vote
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
We present a new methodology for proving security of encryption systems using what we call Dual System Encryption. Our techniques result in fully secure Identity-Based Encryption ...