Correlated Pseudorandomness from Expand-Accumulate Codes

Autor: Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl

Publikováno v: Boyle, E, Couteau, G, Gilboa, N, Ishai, Y, Kohl, L, Resch, N & Scholl, P 2022, Correlated Pseudorandomness from Expand-Accumulate Codes . in Y Dodis & T Shrimpton (eds), Advances in Cryptology – CRYPTO 2022-42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings . Springer, Lecture Notes in Computer Science, vol. 13508, pp. 603-633, 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, United States, 15/08/2022 . https://doi.org/10.1007/978-3-031-15979-4_21
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159787

A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful sources of correlated randomness, such as random oblivious transfers (OT) and vector oblivious linear evaluations (VOLE), with low communication cost. We intro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a7de97968a38eaef294257a514e5303
https://pure.au.dk/portal/da/publications/correlatedpseudorandomnessfrom-expandaccumulate-codes(5cf6ba71-c9cc-4652-94a9-5ff08ba4ac82).html

Programmable Distributed Point Functions

Autor: Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov

Publikováno v: Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159848

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::81070c86beaec6a1e37fb0cbb533bc15
https://doi.org/10.1007/978-3-031-15985-5_5

Low-Complexity Weak Pseudorandom Functions in $$\mathtt {AC}0[\mathtt {MOD}2]$$

Autor: Peter Scholl, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Elette Boyle, Lisa Kohl

Publikováno v: CRYPTO 2021-Annual International Cryptology Conference
CRYPTO 2021-Annual International Cryptology Conference, Aug 2021, Santa Barbara, United States. pp.487-516, ⟨10.1007/978-3-030-84259-8_17⟩
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)

A weak pseudorandom function (WPRF) is a keyed function \(f_k:\{0,1\}^n\rightarrow \{0,1\}\) such that, for a random key k, a collection of samples \((x, f_k(x))\), for uniformly random inputs x, cannot be efficiently distinguished from totally rando

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc41a026174f66a99b5b79e32894dd22
https://hal.archives-ouvertes.fr/hal-03374521

Perennial secure multi-party computation of universal Turing machine

Autor: Vladimir Kolesnikov, Niv Gilboa, Muni Venkateswarlu Kumaramangalam, Juan A. Garay, Shlomi Dolev

Publikováno v: Theoretical Computer Science. 769:43-62

Consider a user who needs to perform computation over an initially unbounded stream of input. The user would like to compute functions of the input that change dynamically due to external events. The focus of this work is outsourcing such computation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1340f1ea24c5f40332d83d2875b7944b
https://doi.org/10.1016/j.tcs.2018.10.012

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation

Autor: Nishant Kumar, Divya Gupta, Nishanth Chandran, Yuval Ishai, Mayank Rathee, Elette Boyle, Niv Gilboa

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030778859
EUROCRYPT (2)

Boyle et al. (TCC 2019) proposed a new approach for secure computation in the preprocessing model building on function secret sharing (FSS), where a gate g is evaluated using an FSS scheme for the related offset family \(g_r(x)=g(x+r)\). They further

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1e5fb1386b4a1094e49e92428f9a827d
https://doi.org/10.1007/978-3-030-77886-6_30