Výsledky vyhledávání - "Black-Box Reductions"

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free

Autor: Gianluca Brian, João Ribeiro, Antonio Faonio, Daniele Venturi, Mark Simkin, Maciej Obremski, Maciej Skorski

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030778859
EUROCRYPT (2)
Brian, G, Faonio, A, Obremski, M, Ribeiro, J, Simkin, M, Skorski, M & Venturi, D 2022, ' The Mother of All Leakages : How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free ', IEEE Transactions on Information Theory, vol. 68, no. 12, pp. 8197-8227 . https://doi.org/10.1109/TIT.2022.3193848

We show that the most common flavors of noisy leakage can be simulated in the information-theoretic setting using a single query of bounded leakage, up to a small statistical simulation error and a slight loss in the leakage parameter. The latter hol

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eacf8473643ac2f1566815b7012a594e
https://doi.org/10.1109/tit.2022.3193848

Zobrazit plný text záznamu

Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle?

Autor: Shaltiel, Ronen

Publikováno v: computational complexity. 32

Yao’s XOR lemma states that for every function f:{0,1}^k → {0,1}, if f has hardness 2/3 for P/poly (meaning that for every circuit C in P/poly, Pr[C(X) = f(X)] ≤ 2/3 on a uniform input X), then the task of computing f(X₁) ⊕ … ⊕ f(X_t) f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27606ccd7679185463d1a30a9b639083
https://doi.org/10.1007/s00037-023-00238-9

Zobrazit plný text záznamu

Kniha

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Black-Box Uselessness: Composing Separations in Cryptography

Autor: Couteau, Geoffroy, Farshim, Pooya, Mahmoody, Mohammad

Publikováno v: ITCS 2021-12th Innovations in Theoretical Computer Science Conference
ITCS 2021-12th Innovations in Theoretical Computer Science Conference, Feb 2021, Online, United States

Black-box separations have been successfully used to identify the limits of a powerful set of tools in cryptography, namely those of black-box reductions. They allow proving that a large set of techniques are not capable of basing one primitive 𝒫

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a8c45e41db00e8bebd7327af0387ca
https://hal.archives-ouvertes.fr/hal-03374178/file/2021-016.pdf

Zobrazit plný text záznamu

On the Structure of Learnability Beyond P/Poly

Autor: Rajgopal, Ninad, Santhanam, Rahul

Motivated by the goal of showing stronger structural results about the complexity of learning, we study the learnability of strong concept classes beyond P/poly, such as PSPACE/poly and EXP/poly. We show the following: 1) (Unconditional Lower Bounds

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40e8f2e5d0aec8ac33df057289156162

Zobrazit plný text záznamu

On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions

Autor: Nanashima, Mikito

Constructing one-way functions based on NP-hardness is a central challenge in theoretical computer science. Unfortunately, Akavia et al. [Akavia et al., 2006] presented strong evidence that a nonadaptive black-box (BB) reduction is insufficient to so

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::54ddbcf5e0d42acd854bc237c93738cb

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání