• všechny e-ziny od 9/1999
  • celou databázi NEWS
  • soutěže 2000-2011
  • další články a BONUSY

Crypto - News


Crypto - News | Security - News

08 / 2006
Vybrali pro vás: TR - Tomáš Rosa, JP - Jaroslav Pinkava, PV - Pavel Vondruška, VK - Vlastimil Klíma

Program Rump Session CRYPTO 2006

Program Rump Session CRYPTO 2006

7:50 How not to protect PC's from power analysis
Yossi Oren, Adi Shamir
7:55 EMA attacks by scanning and invisible countermeasures
Eric Peeters, François-Xavier Standaert, Jean-Jacques Quisquater
7:59 Forging some RSA signatures with pencil and paper
Daniel Bleichenbacher
8:04 A preview on branch misprediction attacks: Using Pentium performance counters to reduce the complexity of timing atttacks
Alexander A. Veith, Andrei V. Belenko Alexei Zhukov
8:08 FFT-based acoustic side-channel cryptanalysis of piano keystrokes
Daniel J. Bernstein
8:08 Analyzing Feistel networks with public intermediate values and applications
Yevgeniy Dodis, Prashant Puniya


8:12 SHA-1 collisions: Partial meaningful at no extra cost?
Christophe De Cannière, Christian Rechberger
8:17 Linear checksums don't help Damgard-Merkle
John Kelsey, Praveen Gauravaram
8:22 Constructing differential paths for SHA-1 collision attack
Jun Yajima, Yu Sasaki, Teruyoshi Iwasaki, Yusuke Naito, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta
8:25 On the complexity of collision attack against SHA-1 and new disturbance vectors
Terutoshi Iwasaki, Jun Yajima, Yu Sasaki, Yusuke Naito, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta

8:28 Lettuce-based cryptography
J. Callas, Tamzen Cannoy, N. van Someren
8:31 Does privacy require true randomness?
Carl Bosley, Yevgeniy Dodis
8:34 The disk encryption algorithm in Windows Vista
Niels Ferguson
8:39 Connect now to MitM
Kaisa Nyberg
8:43 BREAK


8:55 PunchScan and VoComp
Rick Carback, David Chaum, Jeremy Clark, Aleks Essex, Kevin Fisher, Ben Hosp, Stefan Popoveniuc, Jeremy Robin
9:00 Tamper-evident, history-hiding data structures through cryptographic storage -or-Another way to store ballots on a voting machine
John Bethencourt, Dan Boneh, Brent Waters

9:12 On the compressibility of NP instances and cryptographic applications
Danny Harnik, Moni Naor
9:15 Explicit exclusive set systems with applications to broadcast encryption
Craig Gentry, Zulfikar Ramzan, David Woodruff
9:18 (In-)composability of quantum key distribution
Robert Koenig, Renato Renner, Andor Bariska, Ueli Maurer
9:23 Cryptanalysis of quantum randomness
Paul Kocher
9:27 New approaches to digital evidence
Ueli Maurer
9:32 From weak to strong watermarking
Nicholas Hopper, David Molnar, David Wagner
9:36 Stateful public-key cryptosystems: How to encrypt with one 160-bit exponentiation
Mihir Bellare, Tadayoshi Kohno, Victor Shoup


9:55 Security against covert adversaries: Efficient protocols for realistic adversaries
Yonatan Aumann, Yehuda Lindell
10:00 Byzantine agreement with a rational adversary
S. Dov Gordon, Jonathan Katz
10:02 Towards optimal and efficient perfectly secure message transmission
Matthias Fitzi, Matt Franklin, Juan Garay, S. Harsha Vardhan
10:06 Deniability in key exchange protoocols
Mario Di Raimondo, Rosario Gennaro, Hugo Krawczyk
10:10 Reviving the dead 101
Tom Berson, Nigel Smart, Raphael Phan, Orr Dunkelman, Dan Page
10:13 iChair
Thomas Baignères, Matthieu Finiasz
10:15 eBATS: ECRYPT benchmarking of asymmetric systems
Daniel J. Bernstein, Tanja Lange
10:18 Chasing the Rabbit
Erik Zenner Daniel J. Bernstein
10:19 The birthday paradox refuted
Kira Ferguson

Symmetric encryption

10:21 Call for mode: Large-block tweakable encryption
J. Hughes
10:23 Inversion attacks on TEA
Tamoghna Ghosh, Ramarathnam Venkatesan, Stuart Haber
10:26 QUAD: Provably secure?
Dan Bernstein, Chia-Hsin Owen Chen, Jiun-Ming Chen, Bo-Yin Yang
10:30 On the security of Snow 2.0
Gregory V. Bard, Nicolas T. Courtois, Blandine Debraize, Louis Goubin
10:33 Searchable symmetric encryption: Improved definitions and efficient constructions
Reza Curtmola, Juan Garay, Seny Kamara, Rafi Ostrovsky

10:35 Is your most secret password on the public web?
Jean-Jacques Quisquater
10:38 Information-theoretically secure protocols and security under composition
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
10:40 How to win the clone wars
Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich
10:45 A knapsack identification and signature protocol
John Kelsey
10:48 Computationally asymmetric permutations, reversible-gates circuits:
Alex E. Zhukov
10:52 Universally composable security with global setup
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish
10:56 Attribute-based encryption
Vipul Goyal, Omkant Pandey, Amit Sahai, Brent Waters
11:00 Good night!
Zdroj: http://www.iacr.org/conferences/crypto2006/rumpsched.html
Autor: VK

Design: Webdesign