Point Decomposition Problem in Binary Elliptic Curves, by Koray Karabina
We analyze the point decomposition problem (PDP) in binary elliptic curves. It is known that PDP in an elliptic curve group can be reduced to solving a particular system of multivariate non-linear...
View ArticleTraceable CP-ABE on Prime Order Groups: Fully Secure and Fully...
In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), access policies associated with the ciphertexts are generally role-based and the attributes satisfying the policies are generally \emph{shared}...
View ArticlePAGES+,PAGES-, and PAGES-- - Three Families of Block Ciphers, by Dieter Schmidt
PAGES+ is a family of block ciphers based on block ciphers Speck [2] and PAGES [9]. The block length was increased vom 128 bit to 512 bit and additional rounds were introduced to make the cipher more...
View ArticleHardness Estimation of LWE via Band Pruning, by Yoshinori Aono and Le Trieu...
This paper, examining the hardness of the search LWE problem, is a refined continuation of previous works including (Lindner-Peikert 2011, Liu-Nguyen 2013, Aono et al. 2013) using lattice reduction and...
View ArticleExtended Tower Number Field Sieve: A New Complexity for Medium Prime Case, by...
In this paper, we extend the tower number field sieve~(TNFS) proposed by Barbulescu, Gaudry, and Kleinjung in Asaicrypt 2015. Our generalization based on the JLSV algorithm (by Joux, Lercier, Smart,...
View ArticleReviving the Idea of Incremental Cryptography for the Zettabyte era Use case:...
One of the crucial factors for enabling fast and secure computations in the Zettabyte era is the use of incremental cryptographic primitives. For files ranging from several megabytes up to hundreds of...
View ArticleThe Energy Budget for Wireless Security: Extended Version, by Dave Singel\'ee...
Due to the numerous security and privacy risks, applications deployed in wireless networks require strong cryptographic protection. Reducing the energy cost of cryptographic algorithms and protocols...
View ArticleSECOND COORDINATE SEQUENCE OF MP-LRS OVER NONTRIVIAL GALOIS RING OF ODD...
We investigate a well-known way to construct pseudo-random sequences by separation p-adic coordinate sequences of linear recurrences over Galois ring. Commonly it is necessary to know rank estimations...
View ArticleSecure Dating with Four or Fewer Cards, by Antonio Marcedone and Zikai Wen...
In Cornell's "CS4830: Introduction to Cryptography" offered Fall 2015, students are asked to devise a physical secure two-party protocol for computing AND, using 4 cards or fewer. An elegant 5-card...
View ArticleEssentially Optimal Robust Secret Sharing with Maximal Corruptions, by...
In a $t$-out-of-$n$ robust secret sharing scheme, a secret message is shared among $n$ parties who can reconstruct the message by combining their shares. An adversary can adaptively corrupt up to $t$...
View ArticleThe Ultimate Transposition Cipher (UTC), by Gideon Samid
An Ultimate Transposition Cipher (UTC) is defined as a cipher that transposes any permutation of some n elements to any other permutation of the same elements. Hence, by listing together the protected...
View ArticleReal time detection of cache-based side-channel attacks using Hardware...
In this paper we analyze three methods to detect cache-based side-channel attacks in real time, preventing or limiting the amount of leaked information. Two of the three methods are based on machine...
View ArticleComplementary Dual Codes for Counter-measures to Side-Channel Attacks, by...
We recall why linear codes with complementary duals (LCD codes) play a role in counter-measures to passive and active side-channel analyses on embedded cryptosystems. The rate and the minimum distance...
View ArticleOn the Complexity of Additively Homomorphic UC Commitments, by Tore Kasper...
We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. Our scheme is based...
View ArticleSecure Multiparty Computation of a Social Network, by Varsha Bhat Kukkala and...
The recent explosion of online networked data and the discovery of universal topological characteristics in real world networks has led to the emergence of a new domain of research, namely, social...
View ArticleCryptographic Assumptions: A Position Paper, by Shafi Goldwasser and Yael...
The mission of theoretical cryptography is to define and construct provably secure cryptographic protocols and schemes. Without proofs of security, cryptographic constructs offer no guarantees...
View ArticleCARIBE: Adapting Traditional IBE for the Modern Key-Covetous Appetite, by...
Current issues with mass surveillance and a lack of end-user encryption, coupled with a growing demand for key escrow under legal oversight and certificate authority security concerns, raises the...
View ArticlePatterson-Wiedemann type functions on 21 variables with Nonlinearity greater...
Nonlinearity is one of the most challenging combinatorial property in the domain of Boolean function research. Obtaining nonlinearity greater than the bent concatenation bound for odd number of...
View ArticleCryptanalysis of GGH15 Multilinear Maps, by Jean-Sebastien Coron
We describe a cryptanalysis of the GGH15 multilinear maps. Our attack breaks the multipartite key-agreement protocol by generating an equivalent user private key.
View ArticleRevisiting LEGOs: Optimizations, Analysis, and their Limit, by Yan Huang and...
The Cut-and-choose paradigm gives by far the most popular and efficient secure two-party computation protocols in the standard malicious model, able to offer s bits of security with only s copies of...
View Article