Ed3363 (HighFive) -- An alternative Elliptic Curve, by Mike Scott
We propose a new Elliptic curve at a security level significantly greater than the standard 128 bits, that fills a gap in current proposals while bucking the expected security vs cost curve by...
View ArticleMultilinear Map via Scale-Invariant FHE: Enhancing Security and Efficiency,...
Cryptographic multilinear map is a useful tool for constructing numerous secure protocols and Graded Encoding System (GES) is an {\em approximate} concept of multilinear map. In multilinear map...
View ArticleBi-Deniable Inner Product Encryption from LWE, by Daniel Apon and Xiong Fan...
Deniable encryption (Canetti et al. CRYPTO '97) is an intriguing primitive that provides a security guarantee against not only eavesdropping attacks as required by semantic security, but also stronger...
View ArticleAn Efficient Scheme to Reduce Side-Channel Leakage of MAC-Keccak for Smart...
As the new SHA-3 standard, the side-channel security of Keccak has attracted a lot of attentions. Some works show that both software and hardware implementation of Keccak have strong side-channel...
View ArticleProver Anonymous and Deniable Distance-Bounding Authentication, by Sebastien...
In distance-bounding authentication protocols, a verifier confirms that a prover is (1) legitimate and (2) in the verifier's proximity. Proximity checking is done by running time-critical exchanges...
View ArticleArithmetic on Abelian and Kummer Varieties, by David Lubicz and Damien Robert
A Kummer variety is obtained as the quotient of an abelian variety by the automorphism $(-1)$ acting on it. Kummer varieties can be seen as a higher dimensional generalisation of the $x$-coordinate...
View ArticleRecovering Short Generators of Principal Ideals in Cyclotomic Rings, by...
A handful of recent cryptographic proposals rely on the conjectured hardness of the following problem in the ring of integers of a cyclotomic number field: given a basis of a principal ideal that is...
View ArticleMessage Transmission with Reverse Firewalls---Secure Communication on...
A secure reverse firewall, as recently defined by Mironov and Stephens-Davidowitz, is a third party that "sits between a user and the outside world" and modifies the user's sent and received messages...
View ArticleIndifferentiability of Confusion-Diffusion Networks, by Yevgeniy Dodis,...
We show the first positive results for the indifferentiability security of the confusion-diffusion networks (which are extensively used in the design of block ciphers and hash functions). In...
View ArticleUpdates on Sorting of Fully Homomorphic Encrypted Data, by Nitesh Emmadi and...
In this paper, we show implementation results of various algorithms that sort data encrypted with Fully Ho- momorphic Encryption scheme based on Integers. We analyze the complexities of sorting...
View ArticleMulti-user Schnorr security, revisited, by Daniel J. Bernstein
Three recent proposals for standardization of next-generation ECC signatures have included "key prefixing" modifications to Schnorr's signature system. Bernstein, Duif, Lange, Schwabe, and Yang stated...
View ArticleIncremental Program Obfuscation, by Sanjam Garg and Omkant Pandey
Recent advances in program obfuscation suggest that it is possible to create software that can provably safeguard secret information. However, software systems usually contain large executable code...
View ArticleAll or Nothing at All, by Paolo D'Arco and Navid Nasr Esfahani and Douglas R....
We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \cite{St}. An AONT is a bijective mapping that constructs $s$ outputs from $s$ inputs. We consider the security...
View ArticleImproved Masking for Tweakable Blockciphers with Applications to...
A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In...
View ArticleA 128-bit Block Cipher Based on Three Group Arithmetics, by Shenghui Su and...
Enlightened by the IDEA block cipher, the authors put forward the REESSE3+ block cipher (a symmetric key cryptosystem) based on three group arithmetics: addition modulo 2 (bit XOR), addition modulo 2 ^...
View ArticleMulti-Client Oblivious RAM secure against Malicious Servers, by Travis...
It has been an open question whether Oblivious RAM stored on a malicious server can be securely shared among multiple clients. The challenge is that ORAMs are stateful, and clients would need to...
View ArticleFactoring as a Service, by Luke Valenta and Shaanan Cohney and Alex Liao and...
The difficulty of integer factorization is fundamental to modern cryptographic security using RSA encryption and signatures. Although a 512-bit RSA modulus was first factored in 1999, 512-bit RSA...
View ArticleDismantling real-world ECC with Horizontal and Vertical Template Attacks, by...
Recent side-channel attacks on elliptic curve algorithms have shown that the security of these cryptosystems is a matter of serious concern. The development of techniques in the area of Template...
View Articlegot HW crypto? On the (in)security of a Self-Encrypting Drive series, by...
Self encrypting devices (SEDs) doing full disk encryption are getting more and more widespread. Hardware implemented AES encryption provides fast and transparent encryption of all user data on the...
View ArticleOn Secure Two-party Integer Division, by Morten Dahl, Chao Ning, Tomas Toft
We consider the problem of {\it secure integer division}: given two Paillier encryptions of $\ell$-bit values $n$ and $d$, determine an encryption of \intdiv{n}{d} without leaking any information about...
View Article