Sciweavers

52 search results - page 2 / 11
» eurocrypt 2007
Sort
View
EUROCRYPT
2007
Springer
13 years 8 months ago
Revisiting the Efficiency of Malicious Two-Party Computation
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...
David P. Woodruff
EUROCRYPT
2007
Springer
13 years 11 months ago
General Ad Hoc Encryption from Exponent Inversion IBE
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
Xavier Boyen
EUROCRYPT
2007
Springer
13 years 11 months ago
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
Krzysztof Pietrzak
EUROCRYPT
2007
Springer
13 years 11 months ago
Divisible E-Cash Systems Can Be Truly Anonymous
This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2L that he can parceled and spend anonymously and unlinkably. ...
Sébastien Canard, Aline Gouget
EUROCRYPT
2007
Springer
13 years 11 months ago
Ate Pairing on Hyperelliptic Curves
Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has...
Robert Granger, Florian Hess, Roger Oyono, Nicolas...