Sciweavers

242 search results - page 17 / 49
» Randomness in Cryptography
Sort
View
88
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
77
Voted
ASIACRYPT
2003
Springer
15 years 2 months ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
EUROCRYPT
2007
Springer
15 years 3 months ago
General Ad Hoc Encryption from Exponent Inversion IBE
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
Xavier Boyen
COMPSEC
2004
131views more  COMPSEC 2004»
14 years 9 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...
GLOBECOM
2009
IEEE
15 years 4 months ago
Reusable Set Constructions Using Randomized Dissolvent Templates for Biometric Security
—The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for finge...
Jinyang Shi, Kwok-Yan Lam, Ming Gu, Husheng Li