Sciweavers

51 search results - page 6 / 11
» Efficient Public Key Encryption Based on Ideal Lattices
Sort
View
PKC
2009
Springer
240views Cryptology» more  PKC 2009»
14 years 10 months ago
Distributed Public-Key Cryptography from Weak Secrets
Abstract.We introduce the notion of distributed password-based publickey cryptography, where a virtual high-entropy private key is implicitly dened as a concatenation of low-entrop...
Céline Chevalier, David Pointcheval, Michel...
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 9 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
EUROCRYPT
2000
Springer
14 years 1 months ago
Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R)
In a series of papers Patarin proposes new efficient public key systems. A very interesting proposal, called 2-Round Public Key System with S Boxes, or 2R, is based on the difficul...
Eli Biham
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
14 years 1 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...
CCS
2008
ACM
13 years 11 months ago
Identity-based encryption with efficient revocation
Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). Any setting, PKI- or identit...
Alexandra Boldyreva, Vipul Goyal, Virendra Kumar