Sciweavers

598 search results - page 31 / 120
» On the Security of ElGamal Based Encryption
Sort
View
EUROCRYPT
2011
Springer
12 years 11 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
TCC
2009
Springer
123views Cryptology» more  TCC 2009»
14 years 8 months ago
Hierarchical Identity Based Encryption with Polynomially Many Levels
We present the first hierarchical identity based encryption (HIBE) system that has full security for more than a constant number of levels. In all prior HIBE systems in the literat...
Craig Gentry, Shai Halevi
ESORICS
2004
Springer
14 years 1 months ago
Hindering Eavesdropping via IPv6 Opportunistic Encryption
This paper presents an opportunistic encryption scheme strictly layered on top of IPv6. Assuming that a node needs to send data toward another node, our proposal enables the dynami...
Claude Castelluccia, Gabriel Montenegro, Julien La...
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Ciphertext Policy Attribute based Encryption with anonymous access policy
In Ciphertext Policy Attribute based Encryption scheme, the encryptor can fix the policy, who can decrypt the encrypted message. The policy can be formed with the help of attribut...
A. Balu, K. Kuppusamy
CJ
2006
123views more  CJ 2006»
13 years 7 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...