Open Access
ID-based Digital Signature Algorithms
Reads0
Chats0
About:
The article was published on 2003-01-01 and is currently open access. It has received 21 citations till now. The article focuses on the topics: Merkle signature scheme & ElGamal signature scheme.read more
Citations
More filters
Proceedings Article
Succinct non-interactive zero knowledge for a von Neumann architecture
TL;DR: A system that provides succinct noninteractive zero-knowledge proofs (zk-SNARKs) for program executions on a von Neumann RISC architecture and is the first to be universal: it does not need to know the program, but only a bound on its running time.
Book ChapterDOI
Pairing-Based cryptography at high security levels
Neal Koblitz,Alfred Menezes +1 more
TL;DR: Weil and Tate pairings on elliptic curves have attracted much attention in recent years, and Boneh and Franklin [8] as discussed by the authors examined the implications of heightened security needs for pairing-based cryptosystems.
Posted Content
Pairing-Based Cryptography at High Security Levels.
Neal Koblitz,Alfred Menezes +1 more
TL;DR: This paper examines the implications of heightened security needs for pairing-based cryptosystems and describes three different reasons why high-security users might have concerns about the long-term viability of these systems.
Book ChapterDOI
Computing the tate pairing
TL;DR: It is described, in detail sufficient for easy implementation, a fast method for calculation of the Tate pairing, as required for pairing-based cryptographic protocols.
Proceedings Article
Implementing cryptographic pairings
TL;DR: The state-of-the-art in cryptographic pairing implementation is reviewed, starting with a basic Miller algorithm for the Tate pairing, and a series of optimizations and tricks are applied to improve performance.