90 search results - page 3 / 18 » Pairings for cryptographers |
CHES
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
71
Voted
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
81
Voted
ASIACRYPT
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
100
Voted
CANS
2006
Springer
15 years 1 months ago
2006
Springer
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...