Sciweavers

73 search results - page 13 / 15
» Practical Chosen Ciphertext Secure Encryption from Factoring
Sort
View
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
12 years 12 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
IDTRUST
2009
ACM
15 years 4 months ago
Usable secure mailing lists with untrusted servers
Mailing lists are a natural technology for supporting messaging in multi-party, cross-domain collaborative tasks. However, whenever sensitive information is exchanged on such list...
Rakeshbabu Bobba, Joe Muggli, Meenal Pant, Jim Bas...
DASFAA
2009
IEEE
193views Database» more  DASFAA 2009»
15 years 23 days ago
Encryption over Semi-trusted Database
—Database security has become a vital issue in modern Web applications. Critical business data in databases is an evident target for attack. Therefore, ensuring the confidentiali...
Hasan Kadhem, Toshiyuki Amagasa, Hiroyuki Kitagawa
LATINCRYPT
2010
14 years 8 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...