Bootstrappable Identity-Based Fully Homomorphic Encryption, by Michael Clear...
It has been an open problem for a number of years to construct an identity-based fully homomorphic encryption (IBFHE) scheme (first mentioned by Naccache at CHES/CRYPTO 2010). At CRYPTO 2013, Gentry,...
View ArticleRmind: a tool for cryptographically secure statistical analysis, by Dan...
Secure multi-party computation platforms are becoming more and more practical. This has paved the way for privacy-preserving statistical analysis using secure multi-party computation. Simple...
View ArticleLow Probability Differentials and the Cryptanalysis of Full-Round CLEFIA-128,...
So far, low probability differentials for the key schedule of block ciphers have been used as a straightforward proof of security against related-key differential attacks. To achieve the resistance, it...
View ArticleAccountable Storage, by Giuseppe Ateniese and Michael T. Goodrich and...
We introduce Accountable Storage, a framework allowing a client with small local space to outsource n file blocks to an untrusted server and be able (at any point in time after outsourcing) to provably...
View ArticleNSEC5: Provably Preventing DNSSEC Zone Enumeration, by Sharon Goldberg and...
We use cryptographic techniques to study zone enumeration in DNSSEC. DNSSEC is designed to prevent attackers from tampering with domain name system (DNS) messages. The cryptographic machinery used in...
View ArticleResizable Tree-Based Oblivious RAM, by Tarik Moataz and Travis Mayberry and...
Although newly proposed, tree-based Oblivious RAM schemes are drastically more efficient than older techniques, they come with a significant drawback: an inherent dependence on a fixed-size database....
View ArticleImproved Differential Analysis of Block Cipher PRIDE, by Qianqian Yang and...
In CRYPTO 2014 Albrecht \emph{et al.} brought in a 20-round iterative lightweight block cipher PRIDE which is based on a good linear layer for achieving a tradeoff between security and efficiency. A...
View ArticleThe Chaining Lemma and its application, by Ivan Damgaard and Sebastian Faust...
We present a new information theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X0 with high min-entropy and a...
View ArticleA Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse...
In this paper, we propose a new phase-based enumeration algorithm based on two interesting and useful observations for y-sparse representations of short lattice vectors in lattices from SVP challenge...
View ArticlePublicly Verifiable Non-Interactive Arguments for Delegating Computation, by...
We construct publicly verifiable non-interactive arguments that can be used to delegate polynomial time computations. These computationally sound proof systems are completely non-interactive in the...
View ArticleOutlier Privacy, by Edward Lui and Rafael Pass
We introduce a generalization of differential privacy called \emph{tailored differential privacy}, where an individual's privacy parameter is ``tailored'' for the individual based on the individual's...
View ArticlePublic Verification of Private Effort, by Giulia Alberini and Tal Moran and...
We introduce a new framework for polling responses from a large population. Our framework allows gathering information without violating the responders' anonymity and at the same time enables public...
View ArticleConstruction of New Families of MDS Diffusion Layers, by S. M....
Diffusion layers are crucial components of symmetric ciphers. These components, along with suitable Sboxes, can make symmetric ciphers resistant against statistical attacks like linear and...
View ArticleUndermining Isolation through Covert Channels in the Fiasco.OC Microkernel,...
In the new age of cyberwars, system designers have come to recognize the merits of building critical systems on top of small kernels for their ability to provide strong isolation at system level. This...
View ArticleStatistical weakness in Spritz against VMPC-R: in search for the RC4...
We found a statistical weakness in the Spritz algorithm designed by Ronald L. Rivest and Jacob C. N. Schuldt. For N=8: Prob(output(x)=output(x+2)) = 1/N + 0.000498. The bias becomes statistically...
View ArticleRelated-Key Differential Attack on Round Reduced RECTANGLE-80, by Jinyong...
RECTANGLE is a newly proposed lightweight block cipher which allows fast implementations for multiple platforms by using bit-slice techniques. It is an iterative 25-round SPN block cipher with a 64-bit...
View ArticleUniversal One-Way Hash Functions and Average Case Complexity via Inaccessible...
This paper revisits the construction of Universally One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs which also obtains...
View ArticleOn the Pitfalls of using Arbiter-PUFs as Building Blocks, by Georg T. Becker
Physical Unclonable Functions (PUFs) have emerged as a promising solution for securing resource-constrained embedded devices such as RFID-tokens. PUFs use the inherent physical differences of every...
View ArticleTally-based simple decoders for traitor tracing and group testing, by Boris...
The topic of this paper is collusion resistant watermarking, a.k.a. traitor tracing, in particular bias-based traitor tracing codes as introduced by G.Tardos in 2003. The past years have seen an...
View ArticleSimulation-Based Secure Functional Encryption in the Random Oracle Model, by...
In recent years, there has been great interest in Functional Encryption (FE), a generalization of traditional encryption where a token enables a user to learn a specific function of the encrypted data...
View Article