Converses for secret key agreement and secure computing
H Tyagi, S Watanabe - IEEE Transactions on Information …, 2015 - ieeexplore.ieee.org
We consider information theoretic secret key (SK) agreement and secure function
computation by multiple parties observing correlated data, with access to an interactive …
computation by multiple parties observing correlated data, with access to an interactive …
Universal hashing for information-theoretic security
The information-theoretic approach to security entails harnessing the correlated
randomness available in nature to establish security. It uses tools from information theory …
randomness available in nature to establish security. It uses tools from information theory …
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
Can a sender encode a pair of messages (m_0, m_1)(m 0, m 1) jointly, and send their
encoding over (say) a binary erasure channel, so that the receiver can decode exactly one …
encoding over (say) a binary erasure channel, so that the receiver can decode exactly one …
Compact VSS and efficient homomorphic UC commitments
We present a new compact verifiable secret sharing scheme, based on this we present the
first construction of a homomorphic UC commitment scheme that requires only cheap …
first construction of a homomorphic UC commitment scheme that requires only cheap …
Cryptography with one-way communication
There is a large body of work on using noisy communication channels for realizing different
cryptographic tasks. In particular, it is known that secure message transmission can be …
cryptographic tasks. In particular, it is known that secure message transmission can be …
Cryptography from one-way communication: on completeness of finite channels
Abstract Garg et al.(Crypto 2015) initiated the study of cryptographic protocols over noisy
channels in the non-interactive setting, namely when only one party speaks. A major …
channels in the non-interactive setting, namely when only one party speaks. A major …
Byzantine consensus over broadcast channels
N Sangwan, V Narayanan… - 2022 IEEE International …, 2022 - ieeexplore.ieee.org
We study communication with consensus over a broadcast channel-the receivers reliably
decode the sender's message when the sender is honest, and their decoder outputs agree …
decode the sender's message when the sender is honest, and their decoder outputs agree …
Consensus capacity of noisy broadcast channels
N Sangwan, V Narayanan, VM Prabhakaran - arXiv preprint arXiv …, 2022 - arxiv.org
We study communication with consensus over a broadcast channel-the receivers reliably
decode the sender's message when the sender is honest, and their decoder outputs agree …
decode the sender's message when the sender is honest, and their decoder outputs agree …
Efficient generic zero-knowledge proofs from commitments
Even though zero-knowledge has existed for more than 30 years, few generic and efficient
constructions for zero-knowledge exist. In this paper, we present a new kind of commitment …
constructions for zero-knowledge exist. In this paper, we present a new kind of commitment …
[PDF][PDF] New applications of secret-sharing in cryptography
I Giacomelli - 2017 - pure.au.dk
Secret-sharing schemes were introduced in 1979 to implement a specific practical task (ie
secure data storage). However, later on they have found applications as a building block in …
secure data storage). However, later on they have found applications as a building block in …