Sciweavers

2237 search results - page 82 / 448
» On the Security of Random Sources
Sort
View
ISCAS
2006
IEEE
92views Hardware» more  ISCAS 2006»
15 years 11 months ago
Model of a true random number generator aimed at cryptographic applications
— The paper presents a simple stochastic model of a True Random Number Generator, which extracts randomness from the tracking jitter of a phase-locked loop. The existence of such...
Martin Simka, Milos Drutarovský, Viktor Fis...
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
15 years 11 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
COMCOM
2008
82views more  COMCOM 2008»
15 years 5 months ago
Virtual password using random linear functions for on-line services, ATM machines, and pervasive computing
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...
Ming Lei, Yang Xiao, Susan V. Vrbsky, Chung-Chih L...
INFOCOM
2011
IEEE
14 years 8 months ago
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
Qian Wang, Hai Su, Kui Ren, Kwangjo Kim
160
Voted
FOCS
2000
IEEE
15 years 9 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson