Sciweavers

ASIACRYPT
2010
Springer
13 years 9 months ago
A Group Signature Scheme from Lattice Assumptions
Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an observer, yet (2) ensuring traceab...
S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan
ASIACRYPT
2010
Springer
13 years 9 months ago
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Private Set Intersection (PSI) protocols allow one party ("client") to compute an intersection of its input set with that of another party ("server"), such tha...
Emiliano De Cristofaro, Jihye Kim, Gene Tsudik
ASIACRYPT
2010
Springer
13 years 9 months ago
Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
We revisit narrow-pipe designs that are in practical use, and their security against preimage attacks. Our results are the best known preimage attacks on Tiger, MD4, and reduced SH...
Jian Guo, San Ling, Christian Rechberger, Huaxiong...
ASIACRYPT
2010
Springer
13 years 9 months ago
The Degree of Regularity of HFE Systems
Vivien Dubois, Nicolas Gama
TCC
2010
Springer
175views Cryptology» more  TCC 2010»
13 years 10 months ago
Obfuscation of Hyperplane Membership
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
Ran Canetti, Guy N. Rothblum, Mayank Varia
PQCRYPTO
2010
176views Cryptology» more  PQCRYPTO 2010»
13 years 10 months ago
Practical Power Analysis Attacks on Software Implementations of McEliece
The McEliece public-key cryptosystem is based on the fact that decoding unknown linear binary codes is an NP-complete problem. The interest on implementing post-quantum cryptograph...
Stefan Heyse, Amir Moradi, Christof Paar
PKC
2010
Springer
199views Cryptology» more  PKC 2010»
13 years 10 months ago
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
Steven D. Galbraith, Raminder S. Ruprai
PAIRING
2010
Springer
147views Cryptology» more  PAIRING 2010»
13 years 10 months ago
Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves
Constructing pairing-friendly hyperelliptic curves with small ρ-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe...
Ezekiel J. Kachisa