True Random Number Generators Secure in a Changing Environment: Improved...
Barak, Shaltiel Tromer showed how to construct a True Random Number Generator (TRNG) which is secure against an adversary who has some limited control over the environment. In this paper we improve the...
View ArticleSHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers, by...
Homomorphic encryption (HE) systems enable computations on encrypted data, without decrypting and without knowledge of the secret key. In this work, we describe an optimized RLWE-based implementation...
View ArticleA Simple and Improved Algorithm for Integer Factorization with Implicit...
Given two integers $N_1 = p_1q_1$ and $N_2 = p_2q_2$ with $\alpha$-bit primes $q_1,q_2$, suppose that the $t$ least significant bits of $p_1$ and $p_2$ are equal. May and Ritzenhofen (PKC 2009)...
View ArticleConstrained PRFs for Unbounded Inputs, by Hamza Abusalah and Georg Fuchsbauer...
A constrained pseudorandom function $F: K \times X \to Y$ for family of subsets of $X$ is a function where for any key $k \in K$ and set $S$ from the family one can efficiently compute a short...
View ArticleExplicit Non-malleable Codes Resistant to Permutations and Perturbations, by...
A non-malleable code protects messages against various classes of tampering. Informally, a code is non-malleable if the message contained in a tampered codeword is either the original message, or a...
View ArticleExplicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and...
A non-malleable code protects messages against various classes of tampering. Informally, a code is non-malleable if the effect of applying any tampering function on an encoded message is to either...
View ArticleFinding Small Solutions of a Class of Simultaneous Modular Equations and...
In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number generator and consider how to more efficiently attack them in terms of fewer...
View ArticleTwo-Round Adaptively Secure MPC from Indistinguishability Obfuscation, by...
Adaptively secure multiparty computation first studied by Canetti, Feige, Goldreich, and Naor in 1996, is a fundamental notion in cryptography. Adaptive security is particulary hard to achieve in...
View ArticleAdaptively Secure Two-party Computation From Indistinguishability Obfuscation...
We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible...
View ArticleVerifiable computation using multiple provers, by Andrew J. Blumberg and...
The increasing ubiquity of the cloud computing paradigm has renewed focus on the classical problem of allowing weak clients to check the results of computation delegated to powerful servers. Recent...
View ArticleLimits of Extractability Assumptions with Distributional Auxiliary Input, by...
Extractability, or "knowledge," assumptions have recently gained popularity in the cryptographic community, leading to the study of primitives such as extractable one-way functions, extractable hash...
View ArticleAn ultra-lightweight ID-based pairwise key establishment scheme aiming at...
This paper introduces a new key establishment scheme aiming at fully collusion-resistant identity-based symmetric-key agreement. In an identity-based pairwise key agreement scheme, a Trusted Third...
View ArticleOn-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic...
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted "cloud" server. In this notion that we call on-the-fly multiparty computation (MPC), the cloud...
View ArticleA Three-Level Sieve Algorithm for the Shortest Vector Problem, by Feng Zhang...
In AsiaCCS 2011, Wang \textit{et al.} proposed a two-level heuristic sieve algorithm for the shortest vector problem in lattices, which improves the Nguyen-Vidick sieve algorithm. Inspired by their...
View ArticleReflections on Slide with a Twist Attacks, by Itai Dinur and Orr Dunkelman...
Slide attacks use pairs of encryption operations which are slid against each other. Slide with a twist attacks are more sophisticated variants of slide attacks which slide an encryption operation...
View ArticlePrivate Key Recovery Combination Attacks: On Extreme Fragility of Popular...
In this paper we study the question of key management and practical operational security in bitcoin digital currency storage systems. We study the security two most used bitcoin HD Wallet key...
View ArticleA Proxy Re-Encryption Scheme with the Unforgeability of Re-Encryption Keys...
Proxy re-encryption (PRE) schemes are cryptosystems which allow a proxy who has a re-encryption key to convert a ciphertext originally encrypted for one party into a ciphertext which can be decrypted...
View ArticleBRUTUS: Identifying Cryptanalytic Weaknesses in CAESAR First Round...
This ``half-year'' report summarizes our results from security analysis covering all 57 CAESAR first round candidates. We have manually identified security issues with three candidates, two of which...
View ArticleNear Optimal Rate Homomorphic Encryption for Branching Programs, by Aggelos...
We initiate the study of good rate homomorphic encryption schemes. Based on previous work on securely evaluating (binary I/O) branching programs, we propose a leveled homomorphic encryption scheme for...
View ArticleFaster ECC over $\mathbb{F}_{2^{521}-1}$, by Robert Granger and Michael Scott
In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime $2^{521} - 1$. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar...
View Article