Sciweavers

524 search results - page 24 / 105
» On the Security of the DeKaRT Primitive
Sort
View
EUROCRYPT
2010
Springer
14 years 11 days ago
Stam's Collision Resistance Conjecture
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be ...
John P. Steinberger
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 9 months ago
Efficient System-Enforced Deterministic Parallelism
Deterministic execution offers many benefits for debugging, fault tolerance, and security. Current methods of executing parallel programs deterministically, however, often incur h...
Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
IJNSEC
2007
82views more  IJNSEC 2007»
13 years 9 months ago
On Software Implementation of Fast DDP-based Ciphers
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed...
Nikolay A. Moldovyan, Peter A. Moldovyanu, Douglas...
SIAMCOMP
2008
154views more  SIAMCOMP 2008»
13 years 7 months ago
Cryptography in the Bounded-Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
JOC
2011
102views more  JOC 2011»
13 years 4 months ago
Wildcarded Identity-Based Encryption
In this paper we introduce a new primitive called identity-based encryption with wildcards, or WIBE for short. It allows a sender to encrypt messages to a whole range of receivers ...
Michel Abdalla, James Birkett, Dario Catalano, Ale...