Sciweavers

68 search results - page 6 / 14
» On the Security of Oscillator-Based Random Number Generators
Sort
View
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
CTRSA
2005
Springer
210views Cryptology» more  CTRSA 2005»
14 years 2 months ago
Hold Your Sessions: An Attack on Java Session-Id Generation
HTTP session-id’s take an important role in almost any web site today. This paper presents a cryptanalysis of Java Servlet 128-bit session-id’s and an efficient practical predi...
Zvi Gutterman, Dahlia Malkhi
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
IACR
2011
113views more  IACR 2011»
12 years 8 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
INFORMATICALT
2010
132views more  INFORMATICALT 2010»
13 years 5 months ago
An Improved Securer and Efficient Nonce-Based Authentication Scheme with Token-Update
In this paper, we propose a mutual authentication scheme using nonce variable instead of Mac address and accompanying with token updates to improve the functionality. Lee et al. (2...
Chiu-Hsiung Liao, Ching-Te Wang, Hon-Chan Chen