Compiler Assisted Elliptic Curve Cryptography

Barbosa, Manuel; Moss, Andrew; Page, Daniel

doi:10.1007/978-3-540-76843-2_46

Cited by 6 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compiler support for an efficient and secure low-level implementation of cryptographic primitives resistant against software side-channels [33] and applications to elliptic curve cryptography [34] is provided by Cryptography Aware language and cOmpiler (CAO) [35].…”

Section: Related Workmentioning

confidence: 99%

Bringing Zero-Knowledge Proofs of Knowledge to Practice

Krenn

2013

Security Protocols XVII

View full text Add to dashboard Cite

Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that critically rely on ZK-PoKs are being deployed in the real world. The most prominent example is Direct Anonymous Attestation (DAA), which was adopted by the Trusted Computing Group (TCG) and implemented as one of the functionalities of the cryptographic Trusted Platform Module (TPM) chip. Implementing systems using ZK-PoK turns out to be challenging, since ZK-PoK are, loosely speaking, significantly more complex than standard crypto primitives, such as encryption and signature schemes. As a result, implementation cycles of ZK-PoK are time-consuming and error-prone, in particular for developers with minor or no cryptographic skills. In this paper we report on our ongoing and future research vision with the goal to bring ZK-PoK to practice by making them accessible to crypto and security engineers. To this end we are developing compilers and related tools that support and partially automate the design, implementation, verification and secure implementation of ZK-PoK protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Bringing Zero-Knowledge Proofs of Knowledge to Practice

Krenn

2013

Security Protocols XVII

View full text Add to dashboard Cite

show abstract

“…Lastly, there have been several research efforts toward automatically generating cryptographic protocols and executable code. This compiler-like approach has been applied to cryptographic applications such as security protocols [40,45,46,57,63], optimizations to software implementations involving elliptic-curve cryptography [9] and bilinear-map functions [56], secure two-party computation [34,48,49], and zero-knowledge proofs [3, 5-7, 21, 30, 52]. …”

Section: Related Workmentioning

confidence: 99%

Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes

Akinyele

Green

Hohenberger

et al. 2012

Proceedings of the 2012 ACM Conference on Computer and Communications Security

View full text Add to dashboard Cite

As devices everywhere increasingly communicate with each other, many security applications will require low-bandwidth signatures that can be processed quickly. Pairing-based signatures can be very short, but are often costly to verify. Fortunately, they also tend to have efficient batch verification algorithms. Finding these batching algorithms by hand, however, can be tedious and error prone.We address this by presenting AutoBatch, an automated tool for generating batch verification code in either Python or C++ from a high level representation of a signature scheme. AutoBatch outputs both software and, for transparency, a LaTeX file describing the batching algorithm and arguing that it preserves the unforgeability of the original scheme.We tested AutoBatch on over a dozen pairing-based schemes to demonstrate that a computer could find competitive batching solutions in a reasonable amount of time. In particular, it found an algorithm that is faster than a batching algorithm from Eurocrypt 2010. Another novel contribution is that it handles cross-scheme batching, where it searches for a common algebraic structure between two distinct schemes and attempts to batch them together.In this work, we expand upon our paper on AutoBatch appearing in ACM CCS 2012 [2] in a number of ways. We add a new loop-unrolling technique and show that it helps cut the batch verification cost of one scheme by roughly half. We describe our pruning and search algorithms in greater detail, including pseudocode and diagrams. All experiments were also re-run using the RELIC pairing library. We compare those results to our earlier results using the MIRACL library, and discuss why RELIC outperforms MIRACL in all but two cases. Automated proofs of several new batching algorithms are also included.AutoBatch is a useful tool for cryptographic designers and implementors, and to our knowledge, it is the first attempt to outsource to machines the design, proof writing and implementation of signature batch verification schemes.

show abstract

“…A specification language at the implementation level of cryptographic primitives is Cryptography Aware Language and Compiler (CAO) [36]. This framework provides compiler support for efficient and secure implementation of cryptographic primitives resistant against software side-channels [37] and applications to elliptic curve cryptography [38]. In future versions of our compiler we plan to automatically generate implementations of our generated protocols also in CAO.…”

Section: Introductionmentioning

confidence: 99%

Automatic Generation of Sigma-Protocols

Bangerter

Briner²,

Henecka

et al. 2010

Public Key Infrastructures, Services and Applications

View full text Add to dashboard Cite

Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure multi-party computation. Currently, first applications that essentially rely on ZK-PoKs are being deployed in the real world. The most prominent example is the Direct Anonymous Attestation (DAA) protocol, which was adopted by the Trusted Computing Group (TCG) and implemented as one of the functionalities of the cryptographic chip Trusted Platform Module (TPM). Implementing systems using ZK-PoK turns out to be challenging, since ZK-PoK are significantly more complex than standard crypto primitives (e.g., encryption and signature schemes). As a result, the designimplementation cycles of ZK-PoK are time-consuming and error-prone. To overcome this, we present a compiler with corresponding languages for the automatic generation of sound and efficient ZK-PoK based on Σprotocols. The protocol designer using our compiler formulates the goal of a ZK-PoK proof in a high-level protocol specification language, which abstracts away unnecessary technicalities from the designer. The compiler then automatically generates the protocol implementation in Java code; alternatively, the compiler can output a description of the protocol in L A T E X which can be used for documentation or verification.

show abstract

Compiler Assisted Elliptic Curve Cryptography

Cited by 6 publications

References 23 publications

Bringing Zero-Knowledge Proofs of Knowledge to Practice

Bringing Zero-Knowledge Proofs of Knowledge to Practice

Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes

Automatic Generation of Sigma-Protocols

Contact Info

Product

Resources

About