Sciweavers

247 search results - page 42 / 50
» On Pseudorandom Generators in NC
Sort
View
CCS
2007
ACM
14 years 1 months ago
Universally composable and forward-secure RFID authentication and authenticated key exchange
Recently, a universally composable framework for RFID authentication protocols providing availability, anonymity, and authenticity was proposed. In this paper we extend that frame...
Tri Van Le, Mike Burmester, Breno de Medeiros
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
14 years 21 days ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
ATS
2000
IEEE
134views Hardware» more  ATS 2000»
13 years 12 months ago
Fsimac: a fault simulator for asynchronous sequential circuits
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper pre...
Susmita Sur-Kolay, Marly Roncken, Ken S. Stevens, ...
AI
2006
Springer
13 years 11 months ago
On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
Dave A. D. Tompkins, Holger H. Hoos
FC
2006
Springer
107views Cryptology» more  FC 2006»
13 years 11 months ago
Efficient Broadcast Encryption Scheme with Log-Key Storage
In this paper, we present a broadcast encryption scheme with efficient transmission cost under the log-key restriction. Given n users and r revoked users, our scheme has the trans...
Yong Ho Hwang, Pil Joong Lee