Progress in Cryptology – INDOCRYPT 2016

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Lecture Notes in Computer Science

• Publication date

  2016-12-11

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-49890-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A High Throughput/Gate AES Hardware Architecture by Compressing Encryption and Decryption Datapaths - Toward Efficient CBC-Mode Implementation

  2016cited by this paper
• Simple Key Enumeration (and Rank Estimation) Using Histograms: An Integrated Approach

  2016influential reference
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

  2016cited by this paper
• How low can you go? Using side-channel data to enhance brute-force key recovery

  2016influential reference
• On the Hardness of Learning with Rounding over Small Modulus

  2016cited by this paper
• Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations

  2016influential reference
• Cramer-Shoup Like Chosen Ciphertext Security from LPN

  2015cited by this paper
• Comparing Approaches to Rank Estimation for Side-Channel Security Evaluations

  2015influential reference
• Tighter, faster, simpler side-channel security evaluations beyond computing power

  2015influential reference
• Counting Keys in Parallel After a Side Channel Attack

  2015influential reference
• A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-Dimensional Side-Channel Attacks

  2015influential reference
• Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model

  2015cited by this paper
• Fast and Memory-Efficient Key Recovery in Side-Channel Attacks

  2015influential reference
• Simpler and More Efficient Rank Estimation for Side-Channel Security Assessment

  2015influential reference
• Private Computation on Encrypted Genomic Data

  2014cited by this paper
• Simple Chosen-Ciphertext Security from Low-Noise LPN

  2014influential reference
• Candidate weak pseudorandom functions in AC0 ○ MOD2

  2014cited by this paper
• How to Certify the Leakage of a Chip?

  2014influential reference
• How to use indistinguishability obfuscation: deniable encryption, and more

  2014cited by this paper
• How Practical is Public-Key Encryption Based on LPN and Ring-LPN ?

  2014cited by this paper
• Classical hardness of learning with errors

  2013cited by this paper
• Barriers in cryptography with weak, correlated and leaky sources

  2013cited by this paper
• Proceedings of the 2013 ACM workshop on Cloud computing security workshop

  2013cited by this paper
• Learning with Rounding, Revisited: New Reduction, Properties and Applications

  2013influential reference
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

  2013cited by this paper
• Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions

  2013cited by this paper
• Efficient Template Attacks

  2013influential reference
• A Coding-Theoretic Approach to Cryptanalysis

  2013cited by this paper
• Instantiating Random Oracles via UCEs

  2013cited by this paper
• Lossy Codes and a New Variant of the Learning-With-Errors Problem

  2013cited by this paper
• An optimal Key Enumeration Algorithm and its Application to Side-Channel Attacks

  2012influential reference
• Homomorphic Evaluation of the AES Circuit

  2012cited by this paper
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy

  2012cited by this paper
• Better Bootstrapping in Fully Homomorphic Encryption

  2012cited by this paper
• $\textnormal{\textsc{TWINE}}$ : A Lightweight Block Cipher for Multiple Platforms

  2012cited by this paper
• Lapin: An Efficient Authentication Protocol Based on Ring-LPN

  2012cited by this paper
• Pseudorandom Functions and Lattices

  2012influential reference
• Identity-Based (Lossy) Trapdoor Functions and Applications

  2012cited by this paper
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

  2012cited by this paper
• Fully Homomorphic Encryption with Polylog Overhead

  2012cited by this paper
• Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited

  2012cited by this paper
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

  2012cited by this paper
• Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More

  2012influential reference
• Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting

  2012cited by this paper
• IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

  2012cited by this paper
• Univariate side channel attacks and leakage modeling

  2011influential reference
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

  2011cited by this paper
• Pushing the Limits: A Very Compact and a Threshold Implementation of AES

  2011influential reference
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

  2011cited by this paper
• Piccolo: An Ultra-Lightweight Blockcipher

  2011influential reference
• Implementing Gentry's Fully-Homomorphic Encryption Scheme

  2011cited by this paper
• One for all - all for one: unifying standard differential power analysis attacks

  2011influential reference
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

  2011cited by this paper
• Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting

  2011cited by this paper
• Robustness of the Learning with Errors Assumption

  2010cited by this paper
• On Ideal Lattices and Learning with Errors over Rings

  2010cited by this paper
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices

  2009cited by this paper
• Proceedings of the forty-first annual ACM symposium on Theory of computing

  2009cited by this paper
• Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  2009cited by this paper
• A fully homomorphic encryption scheme

  2009cited by this paper
• Computing on Encrypted Data

  2008cited by this paper
• Trapdoors for hard lattices and new cryptographic constructions

  2008cited by this paper
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

  2008cited by this paper
• Lossy trapdoor functions and their applications

  2008cited by this paper
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles

  2008influential reference
• The 128-Bit Blockcipher CLEFIA (Extended Abstract)

  2007cited by this paper
• Deterministic and Efficiently Searchable Encryption

  2007cited by this paper
• Power analysis attacks - revealing the secrets of smart cards

  2007influential reference
• On lattices, learning with errors, random linear codes, and cryptography

  2005cited by this paper
• A Systematic Evaluation of Compact Hardware Implementations for the Rijndael S-Box

  2005influential reference
• A Stochastic Model for Differential Side Channel Cryptanalysis

  2005influential reference
• Hardware Countermeasures against DPA ? A Statistical Analysis of Their Effectiveness

  2004influential reference
• Correlation Power Analysis with a Leakage Model

  2004influential reference
• More on Average Case vs Approximation Complexity

  2003cited by this paper
• Template Attacks

  2002influential reference
• A Compact Rijndael Hardware Architecture with S-Box Optimization

  2001influential reference
• Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

  2001cited by this paper
• Differential Power Analysis

  1999influential reference
• Unbalanced Oil and Vinegar Signature Schemes

  1999cited by this paper
• Probabilistic Encryption

  1984cited by this paper
• SRI International

  1982cited by this paper

• Revisiting AES Related-Key Differential Attacks with Constraint Programming

  2018cites this paper