Homomorphic AES Evaluation using NTRU, by Yarkin Doroz and Yin Hu and Berk Sunar
Since its introduction more than a decade ago the homomorphic properties of the NTRU encryption scheme have gone largely ignored. A variant of NTRU proposed by Stehle and Steinfeld was recently...
View ArticleInformation-Theoretic Timed-Release Security: Key-Agreement, Encryption, and...
In this paper, we study timed-release cryptography with information-theoretic security. As fundamental cryptographic primitives with information-theoretic security, we can consider key-agreement,...
View ArticleOn Weak Keys and Forgery Attacks against Polynomial-based MAC Schemes, by...
Universal hash functions are commonly used primitives for fast and secure message authentication in the form of Message Authentication Codes (MACs) or Authenticated Encryption with Associated Data...
View ArticleTheory of masking with codewords in hardware: low-weight $d$th-order...
In hardware, substitution boxes for block ciphers can be saved already masked in the implementation. The masks must be chosen under two constraints: their number is determined by the implementation...
View ArticleClustering Algorithms for Non-Profiled Single-Execution Attacks on...
Most implementations of public key cryptography employ exponentiation algorithms. Side-channel attacks on secret exponents are typically bound to the leakage of single executions due to cryptographic...
View ArticleOn Extractability Obfuscation, by Elette Boyle and Kai-Min Chung and Rafael Pass
We initiate the study of {\em extractability obfuscation}, a notion first suggested by Barak et al. (JACM 2012): An extractability obfuscator eO for a class of algorithms M guarantees that if an...
View ArticleA Fast Modular Reduction Method, by Zhengjun Cao and Ruizhong Wei and...
We put forth a lookup-table-based modular reduction method which partitions the binary string of an integer to be reduced into blocks according to its runs. Its complexity depends on the amount of runs...
View ArticlePractical polynomial time solutions of several major problems in...
We provide new provable polynomial time solutions of a number of problems in noncommutative-algebraic cryptography. In contrast to the linear centralizer method of \cite{LinCent}, the new method is...
View ArticleVABKS: Verifiable Attribute-based Keyword Search over Outsourced Encrypted...
It is common nowadays for data owners to outsource their data to the cloud. Since the cloud cannot be fully trusted, the outsourced data should be encrypted. This however brings a range of problems,...
View ArticleRebound attacks on Stribog, by Riham AlTawy and Aleksandar Kircanski and Amr...
In August 2012, the Stribog hash function was selected as the new Russian hash standard (GOST R 34.11-2012). Stribog is an AES-based primitive and is considered as an asymmetric reply to the new SHA-3....
View ArticleIntegral Distinguishers for Reduced-round Stribog, by Riham AlTawy and Amr M....
In January 2013, the Stribog hash function officially replaced GOST R 34.11-94 as the new Russian cryptographic hash standard GOST R 34.11-2012. Stribog is an AES-based primitive and is considered as...
View ArticleQuantization in Continuous-Source Zero Secrecy Leakage Helper Data Schemes,...
A Helper Data Scheme (HDS) is a cryptographic primitive that extracts a high-entropy noise-free string from noisy data. Helper Data Schemes are used for preserving privacy in biometric databases and...
View ArticleParallel Gauss Sieve Algorithm : Solving the SVP in the Ideal Lattice of...
In this paper, we report that we have solved the SVP Challenge over a 128-dimensional lattice in Ideal Lattice Challenge from TU Darmstadt, which is currently the highest dimension in the challenge...
View ArticleA New Algorithm for Solving the Approximate Common Divisor Problem and...
In this paper, we propose a new algorithm for solving the approximate common divisors problems, which is based on LLL reduction algorithm of certain special lattice and linear equation solving...
View ArticleElligator Squared: Uniform Points on Elliptic Curves of Prime Order as...
When represented as a bit string in a standard way, even using point compression, an elliptic curve point is easily distinguished from a random bit string. This property potentially allows an adversary...
View ArticlerPIR: Ramp Secret Sharing based Communication Efficient Private Information...
Even as data and analytics driven applications are becoming increasingly popular, retrieving data from shared databases poses a threat to the privacy of their users. For example, investors/patients...
View ArticleEPiC: Efficient Privacy-Preserving Counting for MapReduce, by Erik-Oliver...
In the face of an untrusted cloud infrastructure, outsourced data needs to be protected. We present EPiC, a practical protocol for the privacy-preserving evaluation of a fundamental operation on data...
View ArticleOn the Impacts of Mathematical Realization over Practical Security of Leakage...
In real world, in order to transform an abstract and generic cryptographic scheme into actual physical implementation, one usually undergoes two processes: mathematical realization at algorithmic level...
View ArticleSecurity of the Misty Structure Beyond the Birthday Bound, by Jooyoung Lee
In this paper, we first prove beyond-birthyday-bound security for the Misty structure. Specifically, we show that an $r$-round Misty structure is secure against CCA attacks up to...
View ArticleHuman Assisted Randomness Generation Using Video Games, by Mohsen Alimomeni...
Random number generators have direct applications in information security, online gaming, gambling, and computer science in general. True random number generators need an entropy source which is a...
View Article