Sciweavers

138 search results - page 8 / 28
» A Practical Secure Physical Random Bit Generator
Sort
View
ICITS
2009
13 years 4 months ago
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
Koji Nuida, Goichiro Hanaoka
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
13 years 10 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
USS
2008
13 years 9 months ago
The Practical Subtleties of Biometric Key Generation
The inability of humans to generate and remember strong secrets makes it difficult for people to manage cryptographic keys. To address this problem, numerous proposals have been s...
Lucas Ballard, Seny Kamara, Michael K. Reiter
ICASSP
2008
IEEE
14 years 1 months ago
Secure wireless communications: Secret keys through multipath
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
Akbar M. Sayeed, Adrian Perrig
ICPP
2008
IEEE
14 years 1 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...