Results 1  10
of
46,945
Fully LeakageResilient Signatures
, 2010
"... A signature scheme is fully leakage resilient (Katz and Vaikuntanathan, ASIACRYPT ’09) if it is existentially unforgeable under an adaptive chosenmessage attack even in a setting where an adversary may obtain bounded (yet arbitrary) leakage information on all intermediate values that are used throu ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
algorithm, and constructions of such schemes are known only in the randomoracle model. Moreover, even in the randomoracle model, known schemes are only resilient to leakage of less than half the length of their signing key. In this paper we construct the first fully leakageresilient signature schemes
LeakageResilient Cryptography from Minimal Assumptions
, 2012
"... We present new constructions of leakageresilient cryptosystems, which remain provably secure even if the attacker learns some arbitrary partial information about their internal secret key. For any polynomial ℓ, we can instantiate these schemes so as to tolerate up to ℓ bits of leakage. While there ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
there has been much prior work constructing such leakageresilient cryptosystems under concrete numbertheoretic and algebraic assumptions, we present the first schemes under general and minimal assumptions. In particular, we construct: • Leakageresilient publickey encryption from any standard publickey
Leakageresilient publickey cryptography in the boundedretrieval model
 In Advances in Cryptology – CRYPTO ’09
, 2009
"... We study the design of cryptographic primitives resilient to keyleakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject only to the constraint that the overall amount of such information is bounded by some parameter ℓ. We construct a variety ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
of leakageresilient publickey systems including the first known identification schemes (ID), signature schemes and authenticated key agreement protocols (AKA). Our main result is an efficient threeround leakageresilient AKA in the RandomOracle model. This protocol ensures that session keys are private
On Generic Constructions of CircularlySecure, LeakageResilient PublicKey Encryption Schemes
"... Abstract. We propose generic constructions of publickey encryption schemes, satisfying keydependent message (KDM) security for projections and different forms of keyleakage resilience, from CPAsecure private key encryption schemes with two main abstract properties: (1) additive homomorphism with ..."
Abstract
 Add to MetaCart
Abstract. We propose generic constructions of publickey encryption schemes, satisfying keydependent message (KDM) security for projections and different forms of keyleakage resilience, from CPAsecure private key encryption schemes with two main abstract properties: (1) additive homomorphism
LeakageResilient ElGamal
, 2010
"... Blinding is a popular and wellknown countermeasure to protect publickey cryptosystems against sidechannel attacks. The high level idea is to randomize an exponentiation in order to prevent multiple measurements of the same operation on different data, as such measurements might allow the adversar ..."
Abstract
 Add to MetaCart
. In particular, we propose a muliplicatively blinded version of ElGamal publickey encryption where • we prove that the scheme, instantiated over bilinear groups of prime order p (where p−1 is not smooth) is leakageresilient in the genericgroup model. Here we consider the model of chosencipherext security
LeakageResilient Zero Knowledge ∗
"... In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allowed to obtain arbitrary bounded leakage on the entire state (including the witness and the random coins) of the proverduring ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
) of the proverduring the entire protocol execution. We formalize a meaningful definition of leakageresilient zero knowledge (LRZK) proof system, that intuitively guarantees that the protocol does not yield anything beyond the validity of the statement and the leakage obtained by the verifier. We give a construction
LeakageResilient Coin Tossing
, 2011
"... The ability to collectively toss a common coin among n parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols. In the case of dishonest majority, it was shown to be impossible to achieve less than 1 bias in O(r) rounds (Cleve STOC r ’86). In th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
party protocols with faulty minority, parties need to generate and hold local secret values which are assumed to be perfectly hidden from malicious parties: an assumption which is crucial to proving the resulting common coin is unbiased. This assumption unfortunately does not seem to hold in practice
A leakageresilient mode of operation
 In EUROCRYPT
, 2009
"... Abstract. A weak pseudorandom function (wPRF) is a pseudorandom functions with a relaxed security requirement, where one only requires the output to be pseudorandom when queried on random (and not adversarially chosen) inputs. We show that unlike standard PRFs, wPRFs are secure against memory attack ..."
Abstract

Cited by 77 (5 self)
 Add to MetaCart
attacks, that is they remain secure even if a bounded amount of information about the secret key is leaked to the adversary. As an application of this result we propose a simple mode of operation which – when instantiated with any wPRF – gives a leakageresilient streamcipher. Such a cipher is secure
Practical LeakageResilient IdentityBased Encryption from Simple Assumptions
 ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY
, 2010
"... We design the first LeakageResilient IdentityBased Encryp tion (LRIBE) systems from static assumptions in the stan dard model. We derive these schemes by applying a hash proof technique from Alwen et al. (Eurocrypt '10) to variants of the existing IBE schemes of BonehBoyen, Waters, and Le ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
We design the first LeakageResilient IdentityBased Encryp tion (LRIBE) systems from static assumptions in the stan dard model. We derive these schemes by applying a hash proof technique from Alwen et al. (Eurocrypt '10) to variants of the existing IBE schemes of BonehBoyen, Waters
LeakageResilient ChosenCiphertext Secure PublicKey Encryption from Hash Proof System and OneTime Lossy Filter ∗
, 2013
"... We present a new generic construction of a publickey encryption (PKE) scheme secure against leakageresilient chosenciphertext attacks (LRCCA), from any Hash Proof System (HPS) and any onetime lossy filter (OTLF). Efficient constructions of HPSs and OTLFs from the DDH and DCR assumptions sugge ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a new generic construction of a publickey encryption (PKE) scheme secure against leakageresilient chosenciphertext attacks (LRCCA), from any Hash Proof System (HPS) and any onetime lossy filter (OTLF). Efficient constructions of HPSs and OTLFs from the DDH and DCR assumptions
Results 1  10
of
46,945