Sciweavers

JOC
2011
79views more  JOC 2011»
13 years 2 months ago
Tweakable Block Ciphers
We propose a new cryptographic primitive, the “tweakable block cipher.” Such a cipher has not only the usual inputs—message and cryptographic key—but also a third input, th...
Moses Liskov, Ronald L. Rivest, David Wagner
JOC
2011
104views more  JOC 2011»
13 years 2 months ago
On the Security of Oscillator-Based Random Number Generators
Physical random number generators (a.k.a. TRNGs) appear to be critical components of many cryptographic systems. Yet, such building blocks are still too seldom provided with a form...
Mathieu Baudet, David Lubicz, Julien Micolod, Andr...
JOC
2011
104views more  JOC 2011»
13 years 2 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
JOC
2011
94views more  JOC 2011»
13 years 2 months ago
Mutual Information Analysis: a Comprehensive Study
Mutual Information Analysis is a generic side-channel distinguisher that has been introduced at CHES 2008. It aims to allow successful attacks requiring minimum assumptions and kno...
Lejla Batina, Benedikt Gierlichs, Emmanuel Prouff,...
JOC
2011
157views more  JOC 2011»
13 years 6 months ago
Universally Composable Symbolic Security Analysis
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
Ran Canetti, Jonathan Herzog
JOC
2011
102views more  JOC 2011»
13 years 6 months ago
Wildcarded Identity-Based Encryption
In this paper we introduce a new primitive called identity-based encryption with wildcards, or WIBE for short. It allows a sender to encrypt messages to a whole range of receivers ...
Michel Abdalla, James Birkett, Dario Catalano, Ale...
JOC
2011
81views more  JOC 2011»
13 years 6 months ago
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
Andreas Enge, Pierrick Gaudry, Emmanuel Thom&eacut...