Sciweavers

71 search results - page 10 / 15
» DNA-based random number generation in security circuitry
Sort
View
CCS
2006
ACM
13 years 11 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
ISW
2009
Springer
14 years 2 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
ACNS
2008
Springer
115views Cryptology» more  ACNS 2008»
14 years 1 months ago
The Security of EPC Gen2 Compliant RFID Protocols
The increased functionality of EPC Class1 Gen2 (EPCGen2) is making this standard the de facto specification for inexpensive tags in the RFID industry. EPCGen2 supports only very b...
Mike Burmester, Breno de Medeiros
IJISEC
2008
69views more  IJISEC 2008»
13 years 7 months ago
A survey of certificateless encryption schemes and security models
Abstract This paper surveys the literature on certificateless encryption schemes. In particular, we examine the large number of security models that have been proposed to prove the...
Alexander W. Dent
FOCS
2007
IEEE
14 years 1 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary