Roll-DPoS: a randomized delegated proof of stake scheme for scalable blockchain-based internet of things systems
X Fan, Q Chai - Proceedings of the 15th EAI international conference …, 2018 - dl.acm.org
Delegated Proof-of-Stake (DPoS) is an efficient, decentralized, and flexible consensus
framework available in the blockchain industry. However, applying DPoS to the …
framework available in the blockchain industry. However, applying DPoS to the …
Faster pairing computations on curves with high-degree twists
Research on efficient pairing implementation has focussed on reducing the loop length and
on using high-degree twists. Existence of twists of degree larger than 2 is a very restrictive …
on using high-degree twists. Existence of twists of degree larger than 2 is a very restrictive …
A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
A Guillevic - IACR international conference on public-key …, 2020 - Springer
There have been notable improvements in discrete logarithm computations in finite fields
since 2015 and the introduction of the Tower Number Field Sieve algorithm (TNFS) for …
since 2015 and the introduction of the Tower Number Field Sieve algorithm (TNFS) for …
On the application of pairing based cryptography to wireless sensor networks
P Szczechowiak, A Kargl, M Scott… - Proceedings of the second …, 2009 - dl.acm.org
Recent research results have shown that Elliptic Curve Cryptography (ECC) is feasible on
resource constrained sensor nodes. In this work we demonstrate that the related but more …
resource constrained sensor nodes. In this work we demonstrate that the related but more …
Faster computation of the Tate pairing
TEXT: This paper proposes new explicit formulas for the doubling and addition steps in
Miller's algorithm to compute the Tate pairing on elliptic curves in Weierstrass and in …
Miller's algorithm to compute the Tate pairing on elliptic curves in Weierstrass and in …
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition
Y El Housni, A Guillevic - … Conference on Cryptology and Network Security, 2020 - Springer
A zero-knowledge proof is a method by which one can prove knowledge of general non-
deterministic polynomial (NP) statements. SNARKs are in addition non-interactive, short and …
deterministic polynomial (NP) statements. SNARKs are in addition non-interactive, short and …
Software implementation of pairings
Software Implementation of Pairings Page 1 Chapter XII Software Implementation of Pairings
Darrel HANKERSONa, Alfred MENEZESb and Michael SCOTT c a Auburn University, USA b …
Darrel HANKERSONa, Alfred MENEZESb and Michael SCOTT c a Auburn University, USA b …
[PDF][PDF] Scalable practical byzantine fault tolerance with short-lived signature schemes
X Fan - Proceedings of the 28th Annual International …, 2018 - files.iotex.io
ABSTRACT The Practical Byzantine Fault Tolerance (PBFT) algorithm is a popular solution
for establishing consensus in blockchain systems. The execution time of the PBFT …
for establishing consensus in blockchain systems. The execution time of the PBFT …
High speed flexible pairing cryptoprocessor on FPGA platform
S Ghosh, D Mukhopadhyay… - … Cryptography-Pairing 2010 …, 2010 - Springer
This paper presents a Pairing Crypto Processor (PCP) over Barreto-Naehrig curves (BN
curves). The proposed architecture is specifically designed for field programmable gate …
curves). The proposed architecture is specifically designed for field programmable gate …
Another approach to pairing computation in Edwards coordinates
The recent introduction of Edwards curves has significantly reduced the cost of addition on
elliptic curves. This paper presents new explicit formulae for pairing implementation in …
elliptic curves. This paper presents new explicit formulae for pairing implementation in …