Sciweavers

24188 search results - page 71 / 4838
» Computing on Encrypted Data
Sort
View
FOCS
2007
IEEE
15 years 1 months ago
Space-Efficient Identity Based Encryption Without Pairings
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
Dan Boneh, Craig Gentry, Michael Hamburg
TC
2010
14 years 4 months ago
Reconfigurable Hardware Implementations of Tweakable Enciphering Schemes
Tweakable enciphering schemes are length preserving block cipher modes of operation that provide a strong pseudo-random permutation. It has been suggested that these schemes can b...
Cuauhtemoc Mancillas-López, Debrup Chakrabo...
SAFECOMP
2005
Springer
15 years 3 months ago
Public-Key Cryptography and Availability
When the safety community designs their systems to also maintain security properties, it is likely that public-key encryption will be among the tools that are applied. The security...
Tage Stabell-Kulø, Simone Lupetti
EUROCRYPT
2011
Springer
14 years 1 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
EUROCRYPT
2006
Springer
15 years 1 months ago
Efficient Binary Conversion for Paillier Encrypted Values
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
Berry Schoenmakers, Pim Tuyls