Sciweavers

64 search results - page 5 / 13
» crypto 2006
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
CRYPTO
2006
Springer
97views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Robust Multiparty Computation with Linear Communication Complexity
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
Martin Hirt, Jesper Buus Nielsen
CRYPTO
2006
Springer
88views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
Let H1, H2 be two hash functions. We wish to construct a new hash function H that is collision resistant if at least one of H1 or H2 is collision resistant. Concatenating the outpu...
Dan Boneh, Xavier Boyen
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
Xavier Boyen, Brent Waters
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Inverting HFE Is Quasipolynomial
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
Louis Granboulan, Antoine Joux, Jacques Stern