Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
From MaRDI portal
Publication:5138779
DOI10.1137/19M1236837zbMath1498.94064arXiv2105.00765MaRDI QIDQ5138779
Jad Silbak, Iftach Haitner, Eran Omri, Kobbi Nissim, Ronen Shaltiel
Publication date: 4 December 2020
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00765
Cryptography (94A60) Privacy of data (68P27) Communication complexity, information complexity (68Q11)
Related Items (8)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Correction to: ``Topology-hiding communication from minimal assumptions ⋮ A note on non-interactive zero-knowledge from CDH ⋮ On the complexity of fair coin flipping ⋮ On the complexity of fair coin flipping ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
Cites Work
- Unnamed Item
- Limits on the usefulness of random oracles
- On the complexity of simulating auxiliary input
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- A Uniform Min-Max Theorem with Applications in Cryptography
- Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- Optimal Lower Bound for Differentially Private Multi-party Aggregation
- Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
- Black-Box Separations for Differentially Private Protocols
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Simulating Auxiliary Inputs, Revisited
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Distributed Private Data Analysis: Simultaneously Solving How and What
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Secret key agreement by public discussion from common information
- Common randomness in information theory and cryptography. I. Secret sharing
- Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
- Unconditionally secure key agreement and the intrinsic conditional information
- Advances in Cryptology - EUROCRYPT 2004
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Oblivious-Transfer Amplification
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- How to Fake Auxiliary Input
- Theory of Cryptography
- Theory of Cryptography
- On the complexity of fair coin flipping
This page was built for publication: Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
