Sciweavers

252 search results - page 25 / 51
» How Secure is Deterministic Encryption
Sort
View
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
ASIACRYPT
2007
Springer
14 years 1 months ago
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
Matthew Green, Susan Hohenberger
WPES
2003
ACM
14 years 27 days ago
Hidden Credentials
Hidden Credentials are useful in situations where requests for service, credentials, access policies and resources are extremely sensitive. We show how transactions which depend o...
Jason E. Holt, Robert W. Bradshaw, Kent E. Seamons...
JCM
2007
80views more  JCM 2007»
13 years 7 months ago
On the Impact of Security on the Performance of WLANs
— This paper investigates the impact of security on the performance of WLAN. More specifically, it analyzes the impact of different implementations of encryption techniques used ...
Ezedin Barka, Mohammed Boulmalf
ESORICS
2009
Springer
14 years 8 months ago
Type-Based Analysis of PIN Processing APIs
We examine some known attacks on the PIN verification framework, based on weaknesses of the security API for the tamperresistant Hardware Security Modules used in the network. We s...
Matteo Centenaro, Riccardo Focardi, Flaminia L. Lu...