Sciweavers

Share
EUROCRYPT
2004
Springer
10 years 1 months ago
Multi-party Computation with Hybrid Security
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Matthias Fitzi, Thomas Holenstein, Jürg Wulls...
EUROCRYPT
2004
Springer
10 years 1 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
EUROCRYPT
2004
Springer
10 years 1 months ago
Immunizing Encryption Schemes from Decryption Errors
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...
Cynthia Dwork, Moni Naor, Omer Reingold
EUROCRYPT
2004
Springer
10 years 1 months ago
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Yevgeniy Dodis, Leonid Reyzin, Adam Smith
EUROCRYPT
2004
Springer
10 years 1 months ago
Construction of Secure Random Curves of Genus 2 over Prime Fields
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
Pierrick Gaudry, Éric Schost
EUROCRYPT
2004
Springer
10 years 1 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
EUROCRYPT
2004
Springer
10 years 1 months ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz
EUROCRYPT
2004
Springer
10 years 1 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
EUROCRYPT
2004
Springer
10 years 1 months ago
Concurrent Signatures
We introduce the concept of concurrent signatures. These allow two entities to produce two signatures in such a way that, from the point of view of any third party, both signatures...
Liqun Chen, Caroline Kudla, Kenneth G. Paterson
EUROCRYPT
2004
Springer
10 years 1 months ago
Security Proofs for Identity-Based Identification and Signature Schemes
Mihir Bellare, Chanathip Namprempre, Gregory Neven
books