Triathlon of Lightweight Block Ciphers for the Internet of Things, by Daniel...
In this paper we introduce an open framework for the benchmarking of lightweight block ciphers on a multitude of embedded platforms. Our framework is able to evaluate execution time, RAM footprint, as...
View ArticleSecure and Efficient Initialization and Authentication Protocols for SHIELD,...
With the globalization of semiconductor production, out-sourcing IC fabrication has become a trend in various aspects. This, however, introduces serious threats from the entire untrusted supply chain....
View ArticleFaster sieving for shortest lattice vectors using spherical...
Recently, it was shown that angular locality-sensitive hashing (LSH) can be used to significantly speed up lattice sieving, leading to heuristic time and space complexities for solving the shortest...
View ArticleAnalyzing Permutations for AES-like Ciphers: Understanding ShiftRows, by...
Designing block ciphers and hash functions in a manner that resemble the AES in many aspects has been very popular since Rijndael was adopted as the Advanced Encryption Standard. However, in sharp...
View ArticleAttribute-Based Versions of Schnorr and ElGamal, by Javier Herranz
We design in this paper the first attribute-based cryptosystems that work in the classical Discrete Logarithm, pairing-free, setting. The attribute-based signature scheme can be seen as an extension of...
View ArticleVerifiable and Secure Outsourcing Schemes of Modular Exponentiations Using...
Modular exponentiation is one of basic operations among most of current cryptosystems. Under some algebraic assumptions or cryptography assumptions, it can construct outsourcing schemes for modular...
View ArticleHow to Avoid Obfuscation Using Witness PRFs, by Mark Zhandry
We propose a new cryptographic primitive called \emph{witness pseudorandom functions} (witness PRFs). Witness PRFs are related to witness encryption, but appear strictly stronger: we show that witness...
View ArticleBivariate Polynomials Modulo Composites and their Applications, by Dan Boneh...
We investigate the hardness of finding solutions to bivariate polynomial congruences modulo RSA composites. We establish necessary conditions for a bivariate polynomial to be one-way, second preimage...
View ArticleAdaptively Secure Broadcast Encryption with Small System Parameters, by Mark...
We build the first public-key broadcast encryption systems that simultaneously achieve adaptive security against arbitrary number of colluders, have small system parameters, and have security proofs...
View ArticleGCM Security Bounds Reconsidered, by Yuichi Niwa and Keisuke Ohashi and...
A constant of $2^{22}$ appears in the security bounds of the Galois/Counter Mode of Operation, GCM. In this paper, we first develop an algorithm to generate nonces that have a high counter-collision...
View ArticleA revocable anonymity in Tor, by Amadou Moctar Kane
This new protocol is based on the idea of introducing a revocable anonymity in Tor, which was presented in our recent paper entitled "Another Tor is possible". Compared to that previous paper, this...
View ArticleQuasi-Adaptive NIZK for Linear Subspaces Revisited, by Eike Kiltz and Hoeteck...
Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as the Groth-Sahai proofs, are an extremely powerful tool in pairing-based cryptography. A series of recent works...
View ArticleSalsa20 Cryptanalysis: New Moves and Revisiting Old Styles, by Subhamoy...
In this paper, we revisit some existing techniques in Salsa20 cryptanalysis, and provide some new ideas as well. As a new result, we explain how a valid initial state can be obtained from a Salsa20...
View ArticleEfficient k-out-of-n oblivious transfer protocol, by wang qinglong
A new k-out-of-n oblivious transfer protocol is presented in this paper. The communication cost of our scheme are n+1 messages of sender to receiver and k messages from the receiver to sender. To the...
View ArticleEfficient Format Preserving Encrypted Databases, by Prakruti C, Sashank Dara...
We propose storage efficient SQL-aware encrypted databases that preserve the format of the fields. We give experimental results of storage improvements in CryptDB using FNR encryption scheme.
View ArticleKey Homomorphic PRFs and Their Applications, by Dan Boneh and Kevin Lewi and...
A pseudorandom function F : K x X -> Y is said to be key homomorphic if given F(k1, x) and F(k2, x) there is an efficient algorithm to compute F(k1 xor k2, x), where xor denotes a group operation on...
View ArticleTighter, faster, simpler side-channel security evaluations beyond computing...
A Eurocrypt 2013 paper "Security evaluations beyond computing power: How to analyze side-channel attacks you cannot mount?" by Veyrat-Charvillon, Gérard, and Standaert proposed a "Rank Estimation...
View ArticleTowards Understanding the Known-Key Security of Block Ciphers, by Elena...
Known-key distinguishers for block ciphers were proposed by Knudsen and Rijmen at ASIACRYPT 2007 and have been a major research topic in cryptanalysis since then. A formalization of known-key attacks...
View ArticleNew Distinguishers for Reduced Round Trivium and Trivia-SC using Cube...
In this paper we experiment with cube testers on reduced round Trivium that can act as a distinguisher. Using heuristics, we obtain several distinguishers for Trivium running more than 800 rounds...
View ArticlePrivacy and Access Control for Outsourced Personal Records, by Matteo Maffei...
Cloud storage has rapidly become a cornerstone of many IT infrastructures, constituting a seamless solution for the backup, synchronization, and sharing of large amounts of data. Putting user data in...
View Article
