Bitwise Linear Mappings with Good Cryptographic Properties and Efficient...
Linear mappings are crucial components of symmetric ciphers. A special type of linear mappings are (0,1)-matrices which have been used in symmetric ciphers such as ARIA, E2 and Camellia as diffusion...
View ArticleThe M3dcrypt Password Hashing Function, by Isaiah Makwakwa
M3dcrypt is a password hashing function built around the Advanced Encryption Standard (AES) algorithm and the arcfour pseudorandom function. It uses up to 256-bit pseudorandom salt values and supports...
View ArticleSecure Physical Computation using Disposable Circuits, by Ben Fisch and...
In a secure physical computation, a set of parties each have physical inputs and jointly compute a function of their inputs in a way that reveals no information to any party except for the output of...
View ArticleTradeoff Cryptanalysis of Memory-Hard Functions, by Alex Biryukov and Dmitry...
We explore time-memory and other tradeoffs for memory-hard functions, which are supposed to impose significant computational and time penalties if less memory is used than intended. We analyze two...
View ArticleLeakage-Resilient Cryptography with Key Derived from Sensitive Data, by...
In this paper we address the problem of large space consumption for protocols in the Bounded Retrieval Model (BRM), which require users to store large secret keys subject to adversarial leakage. We...
View ArticleOn the Connection between Leakage Tolerance and Adaptive Security, by Jesper...
We revisit the context of leakage-tolerant interactive protocols as defined by Bitanski, Canetti and Halevi (TCC 2012). Our contributions can be summarized as follows: \begin{itemize} \item For the...
View ArticleA key recovery attack to the scale-invariant NTRU-based somewhat homomorphic...
In this paper we present a key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme proposed by Bos et al~\cite{NTRUbasedFHE} in 2013. The attack allows us to...
View ArticleStructural Weaknesses in the Open Smart Grid Protocol, by Klaus Kursawe and...
The Open Smart Grid Protocol (OSGP) is currently deployed in various countries in large-scale Smart Metering projects. The protocol was developed by the OSGP Alliance and published as a standard by the...
View ArticleImproving GGH Public Key Scheme Using Low Density Lattice Codes, by Reza...
Goldreich-Goldwasser-Halevi (GGH) public key cryptosystem is an instance of lattice-based cryptosystems whose security is based on the hardness of lattice problems. In fact, GGH cryptosystem is the...
View ArticleW-SPS: Designing a Wide-Area Secure Positioning System, by Der-Yeuan Yu and...
Motivated by the security and functional limitations of satellite positioning systems, we explore a design of a Wide-Area Secure Positioning System. The main goals of this system are strong spoofing...
View ArticleA Related-Key Chosen-IV Distinguishing Attack on Full Sprout Stream Cipher,...
Sprout is a new lightweight stream cipher proposed at FSE 2015. According to its designers, Sprout can resist time-memory-data trade-off (TMDTO) attacks with small internal state size. However, we find...
View ArticleCryptanalysis of Full Sprout, by Virginie Lallemand and Mar\'ia Naya-Plasencia
A new method for reducing the internal state size of stream cipher registers has been proposed in FSE 2015, allowing to reduce the area in hardware implementations. Along with it, an instantiated...
View ArticleComputational Election Verifiability: Definitions and an Analysis of Helios...
Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of...
View ArticleAnonymous and Publicly Linkable Reputation Systems, by Johannes Blömer and...
We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as...
View ArticleOn the concrete hardness of Learning with Errors, by Martin R. Albrecht and...
The Learning with Errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In...
View ArticleCollision Attack on 4-branch, Type-2 GFN based Hash Functions using Sliced...
In this work, we apply the sliced biclique cryptanalysis technique to show 8-round collision attack on a hash function H based on 4-branch, Type-2 Generalized Feistel Network (Type-2 GFN). This attack...
View ArticlePerformance and Security Improvements for Tor: A Survey, by Mashael AlSabah...
Tor [Dingledine et al. 2004] is the most widely used anonymity network today, serving millions of users on a daily basis using a growing number of volunteer-run routers. Since its deployment in 2003,...
View ArticleKey Recovery from State Information of Sprout: Application to Cryptanalysis...
Abstract. Design of secure light-weight stream ciphers is an important area in cryptographic hardware & embedded systems and a very recent design by Armknecht and Mikhalev (FSE 2015) has received...
View ArticleFast Revocation of Attribute-Based Credentials for Both Users and Verifiers,...
Attribute-based credentials allow a user to prove properties about herself anonymously. Revoking such credentials, which requires singling them out, is hard because it is at odds with anonymity. All...
View ArticleOne Time Programs with Limited Memory, by Konrad Durnoga and Stefan...
We reinvestigate a notion of {\em one-time programs} introduced in the CRYPTO 2008 paper by Goldwasser {\it et~al.} A one-time program is a device containing a program $C$, with the property that the...
View Article