SPHINCS: practical stateless hash-based signatures, by Daniel J. Bernstein...
This paper introduces a high-security post-quantum stateless hash-based signature scheme that signs hundreds of messages per second on a modern 4-core 3.5GHz Intel CPU. Signatures are 41~KB, public...
View ArticleDistributed Cryptography Based on the Proofs of Work, by Marcin Andrychowicz...
Motivated by the recent success of Bitcoin we study the question of constructing distributed cryptographic protocols in a fully peer-to-peer scenario (without any trusted setup) under the assumption...
View ArticleTightly-Secure Authenticated Key Exchange, by Christoph Bader and Dennis...
We construct the first Authenticated Key Exchange (AKE) protocol whose security does not degrade with an increasing number of users or sessions. We describe a three-message protocol and prove security...
View ArticleMulti-Identity and Multi-Key Leveled FHE from Learning with Errors, by...
Gentry, Sahai and Waters recently presented the first (leveled) identity-based fully homomorphic (IBFHE) encryption scheme (CRYPTO 2013). Their scheme however only works in the single-identity setting;...
View ArticleVerifiable Random Functions from Weaker Assumptions, by Tibor Jager
Constructing a verifiable random function (VRF) with large input space and full adaptive security from a static complexity assumption, like decisional Diffie-Hellman for instance, has proven to be a...
View ArticleEfficient Pairings and ECC for Embedded Systems, by Thomas Unterluggauer and...
The research on pairing-based cryptography brought forth a wide range of protocols interesting for future embedded applications. One significant obstacle for the widespread deployment of pairing-based...
View ArticleReversed Genetic Algorithms for Generation of Bijective S-boxes with Good...
Often S-boxes are the only nonlinear component in a block cipher and as such play an important role in ensuring its resistance to cryptanalysis. Cryptographic properties and constructions of S-boxes...
View ArticlePhysical Characterization of Arbiter PUFs, by Shahin Tajik, Enrico Dietz,...
As intended by its name, Physically Unclonable Functions (PUFs) are considered as an ultimate solution to deal with insecure stor- age, hardware counterfeiting, and many other security problems. How-...
View ArticleA Decentralized Public Key Infrastructure with Identity Retention, by Conner...
Public key infrastructures (PKIs) enable users to look up and verify one another's public keys based on identities. Current approaches to PKIs are vulnerable because they do not offer sufficiently...
View ArticleCryptographic Schemes Based on the ASASA Structure: Black-box, White-box, and...
In this paper we pick up an old challenge to design public key or white-box construction from symmetric cipher components. We design several encryption schemes based on the \textsf{ASASA} structure...
View ArticleUnpicking PLAID - A Cryptographic Analysis of an ISO-standards-track...
The Protocol for Lightweight Authentication of Identity (PLAID) aims at secure and private authentication between a smart card and a terminal. Originally developed by a unit of the Australian...
View ArticleSynchronous Sampling and Clock Recovery of Internal Oscillators for Side...
Measuring power consumption for side-channel analysis typically uses an oscilloscope, which measures the data relative to an internal sample clock. By synchronizing the sampling clock to the clock of...
View ArticleShort Signatures from Homomorphic Trapdoor Functions, by Jacob Alperin-Sheriff
We present a lattice-based stateless signature scheme provably secure in the standard model. Our scheme has a constant number of matrices in the public key and a single lattice vector (plus a tag) in...
View ArticleDual-System Simulation-Soundness with Applications to UC-PAKE and More, by...
We introduce a novel concept of dual-system simulation-sound non-interactive zero-knowledge (NIZK) proofs. Dual-system NIZK proof system can be seen as a two-tier proof system. As opposed to the usual...
View ArticleSummation polynomial algorithms for elliptic curves in characteristic two, by...
The paper is about the discrete logarithm problem for elliptic curves over characteristic 2 finite fields F_2^n of prime degree n. We consider practical issues about index calculus attacks using...
View ArticleLeakage-resilient non-malleable codes, by Divesh Aggarwal and Stefan...
A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the \emph{leakage} attacks in which the...
View ArticleOnline/Off-line Ring Signature Scheme with Provable Security, by Jayaprakash Kar
The article proposes an Online/Off-line Ring Signature Scheme in random oracle model.Security of the scheme relies on both Computational Diffie-Hellman and k-CAA problems. The proposed scheme is proven...
View ArticleServer-Aided Two-Party Computation with Simultaneous Corruption, by Ignacio...
We consider secure two-party computation in the client-server model where there are two adversaries that operate separately but simultaneously, each of them corrupting one of the parties and a...
View ArticleSimulation-Based Secure Functional Encryption in the Random Oracle Model, by...
In recent years, there has been great interest in Functional Encryption (FE), a generalization of traditional encryption where a token enables a user to learn a specific function of the encrypted data...
View ArticleA Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems, by Jean-Charles...
We investigate the security of the family of MQQ public key cryptosystems using multivariate quadratic quasigroups (MQQ). These cryptosystems show especially good performance properties. In particular,...
View Article