In this lecture, we give a high-level tour of DL-Based Threshold Cryptography. We begin with distributed generation of discrete log keys. We describe two protocols: (1) parallel Feldman and its (limited) security properties – good for adaptive Pedersen VSS, but not when the simulator needs to force the outcome (due to rushing), and (2) parallel Pedersen followed by the first protocol. Next, we ...

We present a new approach to construct several leakage-resilient cryptographic primitives, including leakage-resilient public-key encryption (PKE) schemes, authenticated key exchange (AKE) protocols and low-latency key exchange (LLKE) protocols. To this end, we introduce a new primitive called leakage-resilient non-interactive key exchange (LR-NIKE) protocol. We introduce a generic security mod...

Physical cryptographic devices inadvertently leak information through numerous side-channels. Such leakage is exploited by socalled side-channel attacks, which often allow for a complete security breache. A recent trend in cryptography is to propose formal models to incorporate leakage into the model and to construct schemes that are provably secure within them. We design a general compiler tha...

Security models for two-party authenticated key exchange (AKE) protocols have developed overtime to capture the security of AKE protocols even when the adversary learns certain secret values.Increased granularity of security can be modelled by considering partial leakage of secrets in themanner of models for leakage-resilient cryptography, designed to capture side-channel attacks. I...

The applicability of techniques in coding theory to problems in cryptography is illustrated by examples concerning secret-sharing schemes with tailored access priveleges, the design of perfect local randomizers, the construction of t-resilient functions, and the quantization of the nonlinearity of boolean functions. Some novel coding concepts, in particular the notions of minimal codewords in l...

A recent trend in cryptography is to formally prove the leakage resilience of cryptographic implementations – that is, one formally shows that a scheme remains provably secure even in the presence of side channel leakage. Although many of the proposed schemes are secure in a surprisingly strong model, most of them are unfortunately rather inefficient and come without practical security evaluati...

Bitcoin users are directly or indirectly forced to deal with public key cryptography, which has a number of security and usability challenges that differ from the password-based authentication underlying most online banking services. Users must ensure that keys are simultaneously accessible, resistant to digital theft and resilient to loss. In this paper, we contribute an evaluation framework f...

Pseudo-random functions (PRFs) introduced by Goldwasser, Goldreich, and Micali (FOCS 1984), are one of the most important building blocks in cryptography. A PRF family is a family of seeded functions {fs}, with the property that no efficient adversary can tell the difference between getting oracle access to a random PRF function fs, and getting oracle access to a truly random function. In this ...

Leakage resilient cryptography aims to address the issue of inadvertent and unexpected information leakages from physical cryptographic implementations at algorithmic level in a provable manner. In real world, for an abstract mathematical construction to be an actual physical implementation, it usually undergoes two phases: mathematical realization at algorithmic level and physical realization ...

To detect replica nodes in a wireless sensor network, we propose a distributed, deterministic and resilient (DDR) replica detection protocol developed from a witness node based strategy. In DDR, while a location claim message of each node is sent towards the designated verification location in the network, the consistency of the messages is verified at intermediate nodes en route to its final d...