Sciweavers

341 search results - page 29 / 69
» Deniable Functional Encryption
Sort
View
FSTTCS
2006
Springer
15 years 2 months ago
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
Véronique Cortier, Steve Kremer, Ralf K&uum...
IJISEC
2010
121views more  IJISEC 2010»
14 years 9 months ago
Flowchart description of security primitives for controlled physical unclonable functions
Physical Unclonable Functions (PUFs) are physical objects that are unique, practically unclonable and that behave like a random function when subjected to a challenge. Their use h...
Boris Skoric, Marc X. Makkes
INDOCRYPT
2005
Springer
15 years 4 months ago
A Universally Composable Scheme for Electronic Cash
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
Mårten Trolin
AMC
2007
124views more  AMC 2007»
14 years 11 months ago
Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers
In this contribution instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems are formulated as optimization tasks. The performance of Evoluti...
E. C. Laskari, Gerasimos C. Meletiou, Yannis C. St...
FPL
2007
Springer
154views Hardware» more  FPL 2007»
15 years 5 months ago
Physical Unclonable Functions, FPGAs and Public-Key Crypto for IP Protection
In recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. To this end solutions have been proposed based on the idea of bitstream encry...
Jorge Guajardo, Sandeep Kumar, Geert Jan Schrijen,...