Sciweavers

673 search results - page 65 / 135
» Biometric random number generators
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 8 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
CISC
2008
Springer
152views Cryptology» more  CISC 2008»
13 years 9 months ago
Privacy for Private Key in Signatures
One of the important applications of digital signature is anonymous credential or pseudonym system. In these scenarios, it is essential that the identity of the signer is kept secr...
Qianhong Wu, Bo Qin, Yi Mu, Willy Susilo
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 7 months ago
Understanding the Properties of the BitTorrent Overlay
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
Anwar Al Hamra, Arnaud Legout, Chadi Barakat
FOCS
2007
IEEE
14 years 2 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
CISC
2007
Springer
111views Cryptology» more  CISC 2007»
14 years 2 months ago
Multivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
Jintai Ding, Bo-Yin Yang