Simultaneous Hardcore Bits and Cryptography against Memory Attacks

By Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan. Theory of Cryptography Conference, 2009

498 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/81c0b699fb0a86245bb24934374b8612095174a1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

On Ideal Lattices and Learning with Errors over Rings (2010, background): “…Pei09, MP12] attacks, oblivious transfer [PVW08], identity-based encryption [GPV08, CHKP10, ABB10a, ABB10b], various forms of leakage-resilient cryptography (e.g., [AGV09, ACPS09, GKPV10]), fully homomorphic encryption [BV11, BGV12] (following the seminal work of Gentry [Gen09]), and much more.”
On lattices, learning with errors, random linear codes, and cryptography (2009, background): “A much more signiﬁcant improvement is described by Peikert, Vaikuntanathan, and Waters in [34].”
Public-Key Cryptosystems Resilient to Key Leakage (2009, methodology): “Inspired by the cold boot attacks, Akavia, Goldwasser and Vaikuntanathan [2] formalized a general framework for modeling “memory attacks” in which adversarially chosen functions of the secret key are leaked in an adaptive fashion, with the only restriction that the total amount of leakage is bounded”
Attribute-based encryption for circuits (2013, methodology): “Similar LWE parameters were used in the context of leakage resilient cryptography and fully-homomorphic encryption [Akavia et al. 2009; Brakerski and Vaikuntanathan 2011].”
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (2009, background): “The LWE problem is a generalization of the well-known learning parity with noise problem to larger moduli.”
New Algorithms for Learning in Presence of Errors (2011, background): “[4]; see Micciancio and Regev [15] for a survey).”
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model (2009, methodology): “In our original descriptions, this master key is used once to create the secret-key database sk = (sk[1], .”
Efficient Fully Homomorphic Encryption from (Standard) LWE (2011, unknown): “, [33], [19], [4], [5], [10], [1] and many others).”
Data Security and Privacy Protection for Cloud Storage: A Survey (2020, background): “Leakage-resilient can be obtained by designing secret key whose size is longer than the output of f ; 2) The bounded leakage model [1].”
Classical hardness of learning with errors (2013, background): “, [5, 8, 20]), fully homomorphic encryption [14, 13, 12] (following the seminal work of Gentry [16]), and much more.”