Sciweavers

66 search results - page 10 / 14
» crypto 2009
Sort
View
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
14 years 4 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
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...
Marc Joye
AAECC
2009
Springer
138views Algorithms» more  AAECC 2009»
14 years 1 months ago
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
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) ...
Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki ...
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
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 ...
Adi Akavia
CRYPTO
2009
Springer
122views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Utility Dependence in Correct and Fair Rational Secret Sharing
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...
Gilad Asharov, Yehuda Lindell
CRYPTO
2009
Springer
172views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
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 ...
Brent Waters