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 …

[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 …

Succinct {Non-Interactive} zero knowledge for a von neumann architecture

E Ben-Sasson, A Chiesa, E Tromer… - 23rd USENIX Security …, 2014 - usenix.org
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 …

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 …

[書籍][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 …

Scalable zero knowledge via cycles of elliptic curves

E Ben-Sasson, A Chiesa, E Tromer, M Virza - Algorithmica, 2017 - Springer
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 …

[書籍][B] Residue Number Systems

PVA Mohan, PVA Mohan - 2016 - Springer
The design of algorithms and hardware implementation for signal processing systems has
received considerable attention over the last few decades. The primary area of application …

Geppetto: Versatile verifiable computation

C Costello, C Fournet, J Howell… - … IEEE Symposium on …, 2015 - ieeexplore.ieee.org
Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak
client to securely outsource computations to remote parties. Recent work has dramatically …

Faster explicit formulas for computing pairings over ordinary curves

DF Aranha, K Karabina, P Longa, CH Gebotys… - Advances in Cryptology …, 2011 - Springer
We describe efficient formulas for computing pairings on ordinary elliptic curves over prime
fields. First, we generalize lazy reduction techniques, previously considered only for …

High-speed software implementation of the optimal ate pairing over Barreto–Naehrig curves

JL Beuchat, JE González-Díaz, S Mitsunari… - … -Pairing 2010: 4th …, 2010 - Springer
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 …