Sciweavers

23 search results - page 1 / 5
» On the Provable Security of an Efficient RSA-Based Pseudoran...
Sort
View
ASIACRYPT
2006
Springer
13 years 8 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
13 years 8 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
CCS
2010
ACM
13 years 1 months ago
Practical leakage-resilient pseudorandom generators
Cryptographic systems and protocols are the core of many Internet security procedures (such as SSL, SSH, IPSEC, DNSSEC, secure mail, etc.). At the heart of all cryptographic funct...
Yu Yu, François-Xavier Standaert, Olivier P...
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
13 years 6 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
EUROCRYPT
2006
Springer
13 years 8 months ago
A Provable-Security Treatment of the Key-Wrap Problem
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...
Phillip Rogaway, Thomas Shrimpton