Redefining the Transparency Order, by Kaushik Chakraborty and Sumanta Sarkar...
In this paper, we consider the multi-bit Differential Power Analysis (DPA) in the Hamming weight model. In this regard, we revisit the definition of Transparency Order (TO) from the work of Prouff (FSE...
View ArticleTemplate Attacks Based On Priori Knowledge, by Guangjun Fan and Dengguo Feng
Template attacks are widely accepted as the strongest side-channel attacks from the information theoretic point of view, and they can be used as a very powerful tool to evaluate the physical security...
View ArticleAlgebraic Attacks on Human Identification Protocols, by Hassan Jameel Asgha...
Human identification protocols are challenge-response protocols that rely on human computational ability to reply to random challenges from the server based on a public function of a shared secret and...
View ArticleDivisible E-Cash Made Practical, by Sébastien Canard, David Pointcheval,...
Divisible E-cash systems allow users to withdraw a unique coin of value $2^n$ from a bank, but then to spend it in several times to distinct merchants. In such a system, whereas users want anonymity of...
View ArticleFaster ECC over $\mathbb{F}_{2^{521}-1}$, by Robert Granger and Michael Scott
In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime $2^{521} - 1$. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar...
View ArticleBlindBox: Deep Packet Inspection over Encrypted Traffic, by Justine Sherry...
Many network middleboxes perform deep packet inspection, a set of useful tasks which examine packet payloads. These tasks include intrusion detection (IDS), exfiltration detection, and parental...
View ArticlePassword Hashing Competition - Survey and Benchmark, by George Hatzivasilis...
Password hashing is the common approach for maintaining users' password-related information that is later used for authentication. A hash for each password is calculated and maintained at the service...
View ArticleGRECS: Graph Encryption for Approximate Shortest Distance Queries, by Xianrui...
We propose graph encryption schemes that efficiently support approximate shortest distance queries on large-scale encrypted graphs. Shortest distance queries are one of the most fundamental graph...
View ArticleThe Simplest Protocol for Oblivious Transfer, by Tung Chou and Claudio Orlandi
blivious Transfer (OT) is the fundamental building block of cryptographic protocols. In this paper we describe the simplest and most efficient protocol for 1-out-of-2 OT to date, which is obtained by...
View ArticleImproved Top-Down Techniques in Differential Cryptanalysis, by Itai Dinur and...
The fundamental problem of differential cryptanalysis is to find the highest entries in the Difference Distribution Table (DDT) of a given mapping F over n-bit values, and in particular to find the...
View ArticleIdeal Multilinear Maps Based on Ideal Lattices, by Gu Chunsheng
Cryptographic multilinear maps have found many applications, such as multipartite Diffie-Hellman key exchange, general software obfuscation. However, currently only three constructions are known, and...
View ArticleFibonacci Ring Oscillators as True Random Number Generators - A Security...
Fibonacci ring oscillators are shown to have a risk to oscillate periodically instead of chaotically. The security implications of this are discussed. The probability of the occurrence of the periodic...
View ArticleToward Secure Implementation of McEliece Decryption, by Mariya Georgieva and...
We analyse the security regarding timing attacks of implementations of the decryption in McEliece PKC with binary Goppa codes. First, we review and extend the existing attacks, both on the messages and...
View ArticleUnrestricted Identity-Based Aggregate Signcryption in the Standard Model from...
Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by "digital signature followed...
View ArticleJust a Little Bit More, by Joop van de Pol and Nigel P. Smart and Yuval Yarom
We extend the FLUSH+RELOAD side-channel attack of Benger et al. to extract a significantly larger number of bits of information per observed signature when using OpenSSL. This means that by observing...
View ArticleAccess Control in Publicly Verifiable Outsourced Computation, by James...
Publicly Verifiable Outsourced Computation (PVC) allows devices with restricted resources to delegate expensive computations to more powerful external servers, and to verify the correctness of results....
View ArticleLeakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and...
In AsiaCrypt~2013, Qin and Liu proposed a new approach to CCA-security of Public-Key Encryption (PKE) in the presence of bounded key-leakage, from any universal hash proof system (due to Cramer and...
View ArticleDual System Encryption via Predicate Encodings, by Hoeteck Wee
We introduce the notion of predicate encodings, an information-theoretic primitive reminiscent of linear secret-sharing that in addition, satisfies a novel notion of reusability. Using this notion, we...
View ArticleLow Depth Circuits for Efficient Homomorphic Sorting, by Gizem S. \c{C}etin...
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit...
View ArticleMQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems,...
Multivariate Quadratic polynomial (MQ) problem serve as the basis of security for potentially post-quantum cryptosystems. The hardness of solving MQ problem depends on a number of parameters, most...
View Article