Matrix Computational Assumptions in Multilinear Groups, by Paz Morillo and...
We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. This family abstracts and includes as a special case several assumptions used in the literature...
View ArticleSEMA and MESD Leakage of TinyECC 2.0 on a LOTUS Sensor Node, by Jacek...
TinyECC 2.0 is an open source library for Elliptic Curve Cryptography (ECC) in wireless sensor networks. This paper analyzes the side channel susceptibility of TinyECC 2.0 on a LOTUS sensor node...
View ArticleSemantic Security and Indistinguishability in the Quantum World, by Tommaso...
At CRYPTO 2013, Boneh and Zhandry initiated the study of quantum-secure encryption. They proposed first indistinguishability definitions for the quantum world where the actual indistinguishability only...
View ArticleSuccinct Randomized Encodings and their Applications, by Nir Bitansky and...
A {\em randomized encoding} allows to express a ``complex'' computation, given by a function $f$ and input $x$, by a ``simple to compute'' randomized representation $\hat{f}(x)$ whose distribution...
View ArticleA Group-theory Method to The Cycle Structures of Feedback Shift Registers, by...
In this paper, we consider the cycle structures of feedback shift registers (FSRs). At the beginning, the cycle structures of two special classes of FSRs, pure circulating registers (PCRs) and pure...
View ArticleOn Generalized First Fall Degree Assumptions, by Yun-Ju Huang and Christophe...
The first fall degree assumption provides a complexity approximation of Gr\"obner basis algorithms when the degree of regularity of a polynomial system cannot be precisely evaluated. Most importantly,...
View ArticleHigher-Order Side Channel Security and Mask Refreshing, by Jean-Sebastien...
Masking is a widely used countermeasure to protect block cipher implementations against side-channel attacks. The principle is to split every sensitive intermediate variable occurring in the...
View ArticleAchieving Differential Privacy with New Imperfect Randomness, by Yanqing Yao...
We revisit the question of achieving differential privacy with realistic imperfect randomness. In the design of differentially private mechanisms, it's usually assumed that uniformly random source is...
View ArticleComputationally binding quantum commitments, by Dominique Unruh
We present a new definition of computationally binding commitment schemes in the quantum setting, which we call "collapse-binding". The definition applies to string commitments, composes in parallel,...
View ArticleOblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem,...
In this work, we define a new notion of weakly Random-Self-Reducibile cryptosystems and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum)...
View ArticleOptimally Secure Tweakable Blockciphers, by Bart Mennink
We consider the generic design of a tweakable blockcipher from one or more evaluations of a classical blockcipher, in such a way that all input and output wires are of size n bits. As a first...
View ArticlePrivacy-preserving Context-aware Recommender Systems: Analysis and New...
Nowadays, recommender systems have become an indispensable part of our daily life and provide personalized services for almost everything. However, nothing is for free -- such systems have also upset...
View ArticleOn the (im)possibility of receiving security beyond 2^l using an l-bit PRNG:...
Recently,Wang et al. analyzed the security of two EPC C1-G2 compliant RFID authentication protocols, called RAPLT and SRP^+, and proved that these protocols are vulnerable against de-synchronization...
View ArticleA random zoo: sloth, unicorn, and trx, by Arjen K. Lenstra and Benjamin...
Many applications require trustworthy generation of public random numbers. It is shown how this can be achieved using a hash function that is timed to be as slow as desired (sloth), while the...
View ArticleImproved Higher-Order Differential Attacks on MISTY1, by Achiya Bar-On
MISTY1 is a block cipher designed by Matsui in 1997. It is widely deployed in Japan, and is recognized internationally as an European NESSIE-recommended cipher and an ISO standard. Since its...
View ArticleBreaking the Rabin-Williams digital signature system implementation in the...
This paper describes a bug in the implementation of the Rabin-Williams digital signature in the \texttt{Crypto++} framework. The bug is in the misuse of blinding technique that is aimed at preventing...
View ArticleOn Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation,...
The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak's technique has...
View ArticleFinancial Cryptography: Discriminatory Pricing Mechanism , by Sumit Chakraborty
This work presents an adaptive profitable discriminatory pricing mechanism for cloud computing based on secure function decomposition, cryptographic commitments and zero knowledge proof. Cloud...
View ArticleConstant-Round MPC with Fairness and Guarantee of Output Delivery, by S. Dov...
We study the round complexity of multiparty computation with fairness and guaranteed output delivery, assuming existence of an honest majority. We demonstrate a new lower bound and a matching upper...
View ArticleOn the Impossibility of Approximate Obfuscation and Applications to...
The traditional notion of {\em program obfuscation} requires that an obfuscation $\tilde{f}$ of a program $f$ computes the exact same function as $f$, but beyond that, the code of $\tilde{f}$ should...
View Article
