Sciweavers

290 search results - page 35 / 58
» Pseudorandom Bits for Polynomials
Sort
View
CCS
2007
ACM
14 years 2 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
FC
2007
Springer
141views Cryptology» more  FC 2007»
14 years 2 months ago
The Unbearable Lightness of PIN Cracking
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
Omer Berkman, Odelia Moshe Ostrovsky
DFT
2003
IEEE
100views VLSI» more  DFT 2003»
14 years 1 months ago
Scan-Based BIST Diagnosis Using an Embedded Processor
For system-on-chip designs that contain an embedded processor, this paper present a software based diagnosis scheme that can make use of the processor to aid in diagnosis in a sca...
Kedarnath J. Balakrishnan, Nur A. Touba
ATS
1998
IEEE
91views Hardware» more  ATS 1998»
14 years 22 days ago
Special ATPG to Correlate Test Patterns for Low-Overhead Mixed-Mode BIST
In mixed-mode BIST, deterministic test patterns are generated with on-chip hardware to detect the random-pattern-resistant (r.p.r.) faults that are missed by the pseudo-random pat...
Madhavi Karkala, Nur A. Touba, Hans-Joachim Wunder...
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
14 years 3 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...