Sciweavers

345 search results - page 38 / 69
» On the Security of a Variation of Cramer-Shoup's Public Key ...
Sort
View
DCC
2000
IEEE
13 years 7 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
13 years 11 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
DAM
2006
121views more  DAM 2006»
13 years 7 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski
CCS
2007
ACM
14 years 1 months ago
New constructions of fuzzy identity-based encryption
In this paper we construct two new fuzzy identity-based encryption (IBE) schemes in the random oracle model. Not only do our schemes provide public parameters whose size is indepe...
Joonsang Baek, Willy Susilo, Jianying Zhou
ASIACRYPT
2004
Springer
13 years 11 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini