A survey of public-key cryptographic primitives in wireless sensor networks
KA Shim - IEEE Communications Surveys & Tutorials, 2015 - ieeexplore.ieee.org
Cryptographic primitives are fundamental building blocks for designing security protocols to
achieve confidentiality, authentication, integrity and non-repudiation. It is not too much to say …
achieve confidentiality, authentication, integrity and non-repudiation. It is not too much to say …
[PDF][PDF] Zcash protocol specification
D Hopwood, S Bowe, T Hornby, N Wilcox - GitHub: San Francisco, CA …, 2016 - zeccoin.net
Zcash is an implementation of the Decentralized Anonymous Payment scheme Zerocash,
with security fixes and improvements to performance and functionality. It bridges the existing …
with security fixes and improvements to performance and functionality. It bridges the existing …
Succinct {Non-Interactive} zero knowledge for a von neumann architecture
We build a system that provides succinct non-interactive zero-knowledge proofs (zk-
SNARKs) for program executions on a von Neumann RISC architecture. The system has two …
SNARKs) for program executions on a von Neumann RISC architecture. The system has two …
Updating key size estimations for pairings
R Barbulescu, S Duquesne - Journal of cryptology, 2019 - Springer
Recent progress on NFS imposed a new estimation of the security of pairings. In this work
we study the best attacks against some of the most popular pairings and propose new key …
we study the best attacks against some of the most popular pairings and propose new key …
[書籍][B] Mathematics of public key cryptography
SD Galbraith - 2012 - books.google.com
Public key cryptography is a major interdisciplinary subject with many real-world
applications, such as digital signatures. A strong background in the mathematics underlying …
applications, such as digital signatures. A strong background in the mathematics underlying …
Scalable zero knowledge via cycles of elliptic curves
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
Geppetto: Versatile verifiable computation
Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak
client to securely outsource computations to remote parties. Recent work has dramatically …
client to securely outsource computations to remote parties. Recent work has dramatically …
Faster explicit formulas for computing pairings over ordinary curves
We describe efficient formulas for computing pairings on ordinary elliptic curves over prime
fields. First, we generalize lazy reduction techniques, previously considered only for …
fields. First, we generalize lazy reduction techniques, previously considered only for …
High-speed software implementation of the optimal ate pairing over Barreto–Naehrig curves
This paper describes the design of a fast software library for the computation of the optimal
ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the optimal ate …
ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the optimal ate …