Commitment is an important cryptographic primitive. It is well known that noisy channels are
a promising resource to realize commitment in an information-theoretically secure manner …

Noisy channels are a valuable resource from a cryptographic point of view. They can be
used for exchanging secret-keys as well as realizing other cryptographic primitives such as …

In this work, we study commitment over a class of channels called reverse elastic channels
(RECs). In the commitment problem, two mutually distrustful parties, say Alice and Bob, seek …

A natural solution to increase the efficiency of secure computation will be to non-interactively
and securely transform diverse inexpensive-to-generate correlated randomness, like, joint …

As computation and communication become increasingly ubiquitous, data security remains
a key consideration. Hence, cryptographic primitives lie at the heart of several modern digital …

Correlated data can be very useful in cryptography. For instance, if a uniformly random key
is available to Alice and Bob, it can be used as an one-time pad to transmit a message with …

Noise, which cannot be eliminated or controlled by parties, is an incredible facilitator of
cryptography. For example, highly efficient secure computation protocols based on …

Abstract $ P_4 $-free graphs--also known as cographs, complement-reducible graphs, or
hereditary Dacey graphs--have been well studied in graph theory. Motivated by computer …

Noisy channels are valuable resources for cryptography, enabling information-theoretically
secure protocols for cryptographic primitives like bit commitment and oblivious transfer …

P4-free graphs–also known as cographs, complement-reducible graphs, or hereditary
Dacey graphs–have been well studied in graph theory. Motivated by computer science and …