Torsion Limits and Riemann-Roch Systems for Function Fields and Applications,...
The Ihara limit (or constant) $A(q)$ has been a central problem of study in the asymptotic theory of global function fields (or equivalently, algebraic curves over finite fields). It addresses global...
View ArticleOptimality of Non-Adaptive Strategies: The Case of Parallel Games, by Grégory...
Most cryptographic security proofs require showing that two systems are indistinguishable. A central tool in such proofs is that of a game, where winning the game means provoking a certain condition,...
View ArticleOn the Powers of 2, by Robert Granger and Thorsten Kleinjung and Jens...
In 2013 the function field sieve algorithm for computing discrete logarithms in finite fields of small characteristic underwent a series of dramatic improvements, culminating in the first heuristic...
View ArticleHow to Avoid Obfuscation Using Witness PRFs, by Mark Zhandry
Recently, program obfuscation has proven to be an extremely powerful tool and has been used to construct a variety of cryptographic primitives with amazing properties. However, current candidate...
View ArticleBranching Heuristics in Differential Collision Search with Applications to...
In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out of 80) steps with complexity $2^{40.5}$. The best previously published result was on 24 steps. The attack is...
View ArticleOn the security of Xu et al.'s authentication and key agreement scheme for...
In 2014, Xu et al. proposed a two-factor mutual authentication and key agreement scheme for telecare medicine information system (TIMS) based on elliptic curve cryptography (ECC). However, it has been...
View ArticleActively Private and Correct MPC Scheme in $t < n/2$ from Passively Secure...
Recently, several efforts to implement and use an unconditionally secure multi-party computation (MPC) scheme have been put into practice. These implementations are {\em passively} secure MPC schemes...
View ArticleCollision Attack on 5 Rounds of Grøstl, by Florian Mendel and Vincent Rijmen...
In this article, we describe a novel collision attack for up to 5 rounds of the Grøstl hash function. This significantly improves upon the best previously published results on 3 rounds. By using a new...
View ArticlePublicly Evaluable Pseudorandom Functions and Their Applications, by Yu Chen...
We put forth the notion of publicly evaluable pseudorandom functions (PEPRFs), which can be viewed as a non-trivial extension of the standard pseudorandom functions (PRFs). Briefly, PEPRFs are defined...
View ArticleSimulation-Time Security Margin Assessment against Power-Based Side Channel...
A sound design time evaluation of the security of a digital device is a goal which has attracted a great amount of research effort lately. Common security metrics for the attack consider either the...
View ArticleThe Locality of Searchable Symmetric Encryption, by David Cash and Stefano...
This paper proves a lower bound on the trade-off between server storage size and the locality of memory accesses in searchable symmetric encryption (SSE). Namely, when encrypting an index of $N$...
View ArticleIndistinguishability Obfuscation from the Multilinear Subgroup Elimination...
We revisit the question of constructing secure general-purpose indistinguishability obfusca- tion (iO), with a security reduction based on explicit computational assumptions. Previous to our work, such...
View ArticleSakai-Ohgishi-Kasahara Non-Interactive Identity-Based Key Exchange Scheme,...
Identity-based non-interactive key exchange (IB-NIKE) is a powerful but a bit overlooked primitive in identity-based cryptography. While identity-based encryption and signature have been extensively...
View ArticleExponent-inversion Signatures and IBE under Static Assumptions, by Tsz Hon...
Boneh-Boyen signatures are widely used in many advanced cryptosystems. It has a structure of ``inversion in the exponent", and its unforgeability against $q$ chosen-messages attack is proven under the...
View ArticleStructure-Preserving Signatures from Type II Pairings, by Masayuki Abe and...
We investigate structure-preserving signatures in asymmetric bilinear groups with an efficiently computable homomorphism from one source group to the other, i.e., the Type II setting. It has been shown...
View ArticleObfuscation ==> (IND-CPA Security =/=> Circular Security), by Antonio...
Circular security is an important notion for public-key encryption schemes and is needed by several cryptographic protocols. In circular security the adversary is given an extra ``hint'' consisting of...
View ArticleNICV: Normalized Inter-Class Variance for Detection of Side-Channel Leakage,...
Side-Channel Attacks (SCA) are considered a serious threat against embedded cryptography. Therefore security critical chips must be tested for SCA resistance before deployment or certification. SCA are...
View ArticleChipWhisperer: An Open-Source Platform for Hardware Embedded Security...
This paper introduces a complete side channel analysis toolbox, inclusive of the analog capture hardware, target device, capture software, and analysis software. The highly modular design allows use of...
View ArticleOn the Complexity of Finding Low-Level Solutions, by Bjoern Grohmann
In this article the complexity of finding low-level solutions is investigated.
View ArticleCommunication-Efficient MPC for General Adversary Structures, by Joshua...
A multiparty computation (MPC) protocol allows a set of players to compute a function of their inputs while keeping the inputs private and at the same time securing the correctness of the output. Most...
View Article