Aggregate Pseudorandom Functions and Connections to Learning, by Aloni Cohen...
In the first part of this work, we introduce a new type of pseudo-random function for which ``aggregate queries'' over exponential-sized sets can be efficiently answered. An example of an aggregate...
View ArticleEven more practical secure logging: Tree-based Seekable Sequential Key...
Computer log files constitute a precious resource for system administrators for discovering and comprehending security breaches. A prerequisite of any meaningful log analysis is that attempts of...
View ArticleType-Based Verification of Electronic Voting Protocols, by Véronique Cortier...
E-voting protocols aim at achieving a wide range of sophisticated security properties and, consequently, commonly employ advanced cryptographic primitives. This makes their design as well as rigorous...
View ArticleAutomated Dynamic Cube Attack on Block Ciphers: Cryptanalysis of SIMON and...
A few work has ever been performed in cryptanalysis of block ciphers using cube attacks. This paper presents a new framework for an efficient key recovery attack on block ciphers based on cube...
View ArticleParallel (probable) lock-free HashSieve: a practical sieving algorithm for...
In this paper, we assess the practicability of HashSieve, a recently proposed sieving algorithm for the Shortest Vector Problem (SVP) on lattices, on multi-core shared memory systems. To this end, we...
View ArticleHigh Performance Lattice-based CCA-secure Encryption, by Rachid...
Lattice-based encryption schemes still suffer from a low message throughput per ciphertext. This is mainly due to the fact that the underlying schemes do not tap the full potentials of LWE. Many...
View ArticleFrom Weak to Strong Zero-Knowledge and Applications, by Kai-Min Chung and...
The notion of \emph{zero-knowledge} \cite{GMR85} is formalized by requiring that for every malicious efficient verifier $V^*$, there exists an efficient simulator $S$ that can reconstruct the view of...
View ArticleCMCC: Misuse Resistant Authenticated Encryption with Minimal Ciphertext...
In some wireless environments, minimizing the size of messages is paramount due to the resulting significant energy savings. We present CCS which is a new family of tweakable enciphering schemes (TES)....
View ArticleA Practical Second-Order Fault Attack against a Real-World Pairing...
Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and...
View ArticleA Denial of Service Attack against Fair Computations using Bitcoin Deposits,...
Bitcoin supports complex transactions where the recipient of a transaction can be programmatically determined. Using these transactions, multi-party computation protocols that aim to ensure fairness...
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 ArticleGroup Signature with Deniability: How to Disavow a Signature, by Ai Ishida,...
Group signature is a class of digital signatures with enhanced privacy. By using this type of signature, a user can prove membership of a specific group without revealing his identity, but in the case...
View ArticleUse of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring...
Many cryptographic protocols derive their security from the apparent computational intractability of the integer factorization problem. Currently, the best known integer-factoring algorithms run in...
View ArticleReliable Information Extraction for Single Trace Attacks, by Valentina Banciu...
Side-channel attacks using only a single trace crucially rely on the capability of reliably extracting side-channel information (e.g. Hamming weights of intermediate target values) from traces. In...
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 ArticleCryptanalysis and improvement of a certificateless multi-proxy signature...
Multi-proxy signature allows an original signer authorizing a proxy group as his proxy agent and only the cooperation of all proxy signers in the group can create a proxy signature on behalf of the...
View ArticleSecurity and Efficiency Analysis of The Hamming Distance Computation Protocol...
In Financial Cryptography 2013, Bringer, Chabanne and Patey proposed two cryptographic protocols for the computation of Hamming distance in the two-party setting. Their first scheme uses Oblivious...
View Article(Hierarchical) Identity-Based Encryption from Affine Message Authentication,...
We provide a generic transformation from any \emph{affine} message authentication code (MAC) to an identity-based encryption (IBE) scheme over pairing groups of prime order. If the MAC satisfies a...
View ArticleEfficient and Verifiable Algorithms for Secure Outsourcing of Cryptographic...
Reducing the computational cost of cryptographic computations for resource-constrained devices is an active research area. Outsourcing the computation to an external server securely provides a...
View ArticleMulti-Identity and Multi-Key Leveled FHE from Learning with Errors, by...
Gentry, Sahai and Waters recently presented the first (leveled) identity-based fully homomorphic (IBFHE) encryption scheme (CRYPTO 2013). Their scheme however only works in the single-identity setting;...
View Article