Sciweavers

255 search results - page 8 / 51
» Security of Encryption Schemes in Weakened Random Oracle Mod...
Sort
View
21
Voted
DCC
2005
IEEE
14 years 7 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
IJNSEC
2010
128views more  IJNSEC 2010»
13 years 2 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
PROVSEC
2009
Springer
14 years 2 months ago
Chosen-Ciphertext Secure RSA-Type Cryptosystems
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
Benoît Chevallier-Mames, Marc Joye
BIRTHDAY
2010
Springer
13 years 8 months ago
Automated Proofs for Asymmetric Encryption
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...
Judicaël Courant, Marion Daubignard, Cristian...
EUROCRYPT
2006
Springer
13 years 11 months ago
Practical Identity-Based Encryption Without Random Oracles
We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems
Craig Gentry