Sciweavers

252 search results - page 47 / 51
» How Secure is Deterministic Encryption
Sort
View
ITNG
2010
IEEE
13 years 6 months ago
Record Setting Software Implementation of DES Using CUDA
—The increase in computational power of off-the-shelf hardware offers more and more advantageous tradeoffs among efficiency, cost and availability, thus enhancing the feasibil...
Giovanni Agosta, Alessandro Barenghi, Fabrizio De ...
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
13 years 7 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 3 days ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
POPL
2000
ACM
13 years 12 months ago
Authentication Primitives and Their Compilation
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
Martín Abadi, Cédric Fournet, George...
ASPLOS
2008
ACM
13 years 9 months ago
Overshadow: a virtualization-based approach to retrofitting protection in commodity operating systems
Commodity operating systems entrusted with securing sensitive data are remarkably large and complex, and consequently, frequently prone to compromise. To address this limitation, ...
Xiaoxin Chen, Tal Garfinkel, E. Christopher Lewis,...