Sciweavers

55 search results - page 4 / 11
» crypto 2004
Sort
View
CRYPTO
2004
Springer
126views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Compressed Pairings
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
Michael Scott, Paulo S. L. M. Barreto
CRYPTO
2004
Springer
102views Cryptology» more  CRYPTO 2004»
13 years 9 months ago
Complete Classification of Bilinear Hard-Core Functions
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...
Thomas Holenstein, Ueli M. Maurer, Johan Sjöd...
DATE
2004
IEEE
149views Hardware» more  DATE 2004»
13 years 9 months ago
A Logic Level Design Methodology for a Secure DPA Resistant ASIC or FPGA Implementation
This paper describes a novel design methodology to implement a secure DPA resistant crypto processor. The methodology is suitable for integration in a common automated standard ce...
Kris Tiri, Ingrid Verbauwhede
CRYPTO
2004
Springer
130views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Signature Schemes and Anonymous Credentials from Bilinear Maps
Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
Jan Camenisch, Anna Lysyanskaya
CRYPTO
2004
Springer
79views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
Antoine Joux