On the Complexity of Simulating Auxiliary Input

Chen, Yi-Hsiu; Chung, Kai-Min; Liao, Jingqiu

doi:10.1007/978-3-319-78372-7_12

Cited by 9 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Remark 1.2 (Auxiliary input simulators, and the leakage simulation lemmas). Theorem 1.1 is similar in spirit to the so called "leakage simulation lemma" [33,26,35,31,32,5].…”

Section: Every Two-party Single Bit Output Protocol Has a Simulator And A Forecastermentioning

confidence: 84%

“…This is crucial in our applications. In contrast, in the leakage simulation lemma the simulator is a circuit of size s ′ > s and does not belong to the class C. Moreover, there are negative results [33,5] showing limitations on proving the leakage simulation lemma with s ′ ≤ s.…”

Section: Every Two-party Single Bit Output Protocol Has a Simulator A...mentioning

confidence: 99%

“…The complexity s ′ is some polynomial in s, ℓ, 1 ρ (where ℓ is the bit length of Z). The reader is referred to [5] for a discussion of works in this framework.…”

Section: Every Two-party Single Bit Output Protocol Has a Simulator And A Forecastermentioning

confidence: 99%

See 2 more Smart Citations

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Haitner

Nissim

Omri

et al. 2018

2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Let π be an efficient two-party protocol that given security parameter κ, both parties output single bits X κ and Y κ , respectively. We are interested in how (X κ , Y κ ) "appears" to an efficient adversary that only views the transcript T κ . We make the following contributions:• We develop new tools to argue about this loose notion and show (modulo some caveats)that for every such protocol π, there exists an efficient simulator such that the following holds: on input T κ , the simulator outputs a pair (

show abstract

“…Remark 1.2 (Auxiliary input simulators, and the leakage simulation lemmas). Theorem 1.1 is similar in spirit to the so called "leakage simulation lemma" [33,26,35,31,32,5].…”

Section: Every Two-party Single Bit Output Protocol Has a Simulator And A Forecastermentioning

confidence: 84%

Section: Every Two-party Single Bit Output Protocol Has a Simulator A...mentioning

confidence: 99%

See 1 more Smart Citation

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Haitner

Nissim

Omri

et al. 2018

2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

show abstract

“…The existence of an algorithm to construct the simulator h was dubbed the leakage simulation lemma by Chen, Chung, and Liao [CCL18]. The algorithm, much like those for achieving outcome indistinguishability, appears in two variants in the literature: one based on projected gradient descent-like steps [JP14, TTV09, Sko17], and the other based on multiplicative weight updates [VZ13,CCL18].…”

Section: Connection To Cryptographymentioning

confidence: 99%

New Insights into Multi-Calibration

Dwork¹,

Lee²,

Lin³

et al. 2023

Preprint

View full text Add to dashboard Cite

We identify a novel connection between the recent literature on multi-group fairness for prediction algorithms and well-established notions of graph regularity from extremal graph theory. We frame our investigation using new, statistical distance-based variants of multi-calibration that are closely related to the concept of outcome indistinguishability. Adopting this perspective leads us naturally not only to our graph theoretic results, but also to new multi-calibration algorithms with improved complexity in certain parameter regimes, and to a generalization of a state-of-the-art result on omniprediction. Along the way, we also unify several prior algorithms for achieving multi-group fairness, as well as their analyses, through the lens of no-regret learning.

show abstract

“…Theorem 2.1 (Imported Theorem [CCL18]). Let n, ℓ ∈ N, ǫ > 0, and C leak be a family of distinguisher circuits from {0, 1} n × {0, 1} ℓ → {0, 1} of size s(n).…”

Section: Preliminariesmentioning

confidence: 99%

Indistinguishability Obfuscation from Well-Founded Assumptions

Jain¹,

Lin²,

Sahai³

2020

Preprint

View full text Add to dashboard Cite

In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Theorem (Informal). Let τ ∈ (0, ∞), δ ∈ (0, 1), ǫ ∈ (0, 1) be arbitrary constants. Assume sub-exponential security of the following assumptions, where λ is a security parameter, and the parameters ℓ, k, n below are large enough polynomials in λ:

show abstract

On the Complexity of Simulating Auxiliary Input

Cited by 9 publications

References 22 publications

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

New Insights into Multi-Calibration

Indistinguishability Obfuscation from Well-Founded Assumptions

Contact Info

Product

Resources

About