Sciweavers

2237 search results - page 166 / 448
» On the Security of Random Sources
Sort
View
226
Voted
CCS
2006
ACM
15 years 10 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
EUROCRYPT
2006
Springer
15 years 10 months ago
Hiding Secret Points Amidst Chaff
Motivated by the representation of biometric and multimedia objects, we consider the problem of hiding noisy point-sets using a secure sketch. A point-set X consists of s points fr...
Ee-Chien Chang, Qiming Li
JOC
2011
104views more  JOC 2011»
14 years 9 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
SACRYPT
2004
Springer
125views Cryptology» more  SACRYPT 2004»
16 years 9 days ago
Password Based Key Exchange with Mutual Authentication
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
Shaoquan Jiang, Guang Gong
ESORICS
2008
Springer
15 years 8 months ago
On the Impact of User Movement Simulations in the Evaluation of LBS Privacy- Preserving Techniques
The evaluation of privacy-preserving techniques for LBS is often based on simulations of mostly random user movements that only partially capture real deployment scenarios. We clai...
Sergio Mascetti, Dario Freni, Claudio Bettini, Xia...