Sciweavers

1064 search results - page 125 / 213
» Cryptography from Anonymity
Sort
View
CSFW
2007
IEEE
14 years 4 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
ICMCS
2007
IEEE
164views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Constructing Secure Content-Dependent Watermarking Scheme using Homomorphic Encryption
Content-dependent watermarking (CDWM) has been proposed as a solution to overcome the potential estimation attack aiming to recover and remove the watermark from the host signal. ...
Zhi Li, Xinglei Zhu, Yong Lian, Qibin Sun
CHES
2007
Springer
328views Cryptology» more  CHES 2007»
14 years 4 months ago
High-Speed True Random Number Generation with Logic Gates Only
It is shown that the amount of true randomness produced by the recently introduced Galois and Fibonacci ring oscillators can be evaluated experimentally by restarting the oscillato...
Markus Dichtl, Jovan Dj. Golic
FSE
2007
Springer
101views Cryptology» more  FSE 2007»
14 years 4 months ago
Producing Collisions for Panama, Instantaneously
We present a practical attack on the Panama hash function that generates a collision in 26 evaluations of the state updating function. Our attack improves that of Rijmen and cowork...
Joan Daemen, Gilles Van Assche
PKC
2007
Springer
147views Cryptology» more  PKC 2007»
14 years 4 months ago
New Chosen-Ciphertext Attacks on NTRU
We present new and efficient key-recovery chosen-ciphertext attacks on NTRUencrypt. Our attacks are somewhat intermediate between chosen-ciphertext attacks on NTRUencrypt previousl...
Nicolas Gama, Phong Q. Nguyen