Sciweavers

341 search results - page 38 / 69
» Deniable Functional Encryption
Sort
View
CCS
2010
ACM
14 years 11 months ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...
ICICS
2004
Springer
15 years 4 months ago
On the Minimal Assumptions of Group Signature Schemes
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
Michel Abdalla, Bogdan Warinschi
FSE
2003
Springer
123views Cryptology» more  FSE 2003»
15 years 4 months ago
The Security of "One-Block-to-Many" Modes of Operation
In this paper, we investigate the security, in the Luby-Rackoff security paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block ou...
Henri Gilbert
CRYPTO
1992
Springer
156views Cryptology» more  CRYPTO 1992»
15 years 2 months ago
DES is not a Group
We prove that the set of DES permutations (encryption and decryption for each DES key) is not closed under functional composition. This implies that, in general, multiple DES-encry...
Keith W. Campbell, Michael J. Wiener
AMC
2005
188views more  AMC 2005»
14 years 10 months ago
An efficient signcryption scheme with forward secrecy based on elliptic curve
An efficient signcryption scheme based on elliptic curve is proposed in this paper. The signcryption scheme combines digital signature and encryption functions. The proposed schem...
Ren-Junn Hwang, Chih-Hua Lai, Feng-Fu Su