Sciweavers

199 search results - page 18 / 40
» Sender-Side Public Key Deniable Encryption Scheme
Sort
View
ICCD
2006
IEEE
132views Hardware» more  ICCD 2006»
15 years 7 months ago
FPGA-based Design of a Large Moduli Multiplier for Public Key Cryptographic Systems
— High secure cryptographic systems require large bit-length encryption keys which presents a challenge to their efficient hardware implementation especially in embedded devices...
Osama Al-Khaleel, Christos A. Papachristou, Franci...
ICALP
2005
Springer
15 years 3 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
IACR
2011
113views more  IACR 2011»
13 years 9 months ago
Fully Homomorphic SIMD Operations
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
Nigel P. Smart, Frederik Vercauteren
CSFW
2009
IEEE
15 years 4 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
CORR
2004
Springer
107views Education» more  CORR 2004»
14 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...