Correlated pseudorandomness from expand-accumulate codes

E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl… - Annual International …, 2022 - Springer
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 …

Correlated pseudorandom functions from variable-density LPN

E Boyle, G Couteau, N Gilboa, Y Ishai… - 2020 IEEE 61st …, 2020 - ieeexplore.ieee.org
Correlated secret randomness is a useful resource for many cryptographic applications. We
initiate the study of pseudorandom correlation functions (PCFs) that offer the ability to …

Expand-convolute codes for pseudorandom correlation generators from LPN

S Raghuraman, P Rindal, T Tanguy - Annual International Cryptology …, 2023 - Springer
The recent development of pseudorandom correlation generators (PCG) holds tremendous
promise for highly efficient MPC protocols. Among other correlations, PCGs allow for the …

Improved alternating-moduli PRFs and post-quantum signatures

N Alamati, GV Policharla, S Raghuraman… - Annual International …, 2024 - Springer
We revisit the alternating moduli paradigm for constructing symmetric key primitives with a
focus on constructing highly efficient protocols to evaluate them using secure multi-party …

Correlated pseudorandomness from the hardness of quasi-abelian decoding

M Bombar, G Couteau, A Couvreur… - Annual International …, 2023 - Springer
A recent paradigm put forth by Boyle et al.(CCS 2018, Crypto 2019) showed how
pseudorandom correlation generators (PCG) can be used to generate large amounts of …

Pseudorandom functions: Three decades later

A Bogdanov, A Rosen - Tutorials on the Foundations of Cryptography …, 2017 - Springer
Abstract In 1984, Goldreich, Goldwasser and Micali formalized the concept of
pseudorandom functions and proposed a construction based on any length-doubling …

Exploring crypto dark matter: New simple PRF candidates and their applications

D Boneh, Y Ishai, A Passelègue, A Sahai… - Theory of Cryptography …, 2018 - Springer
Pseudorandom functions (PRFs) are one of the fundamental building blocks in
cryptography. Traditionally, there have been two main approaches for PRF design: the …

MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications

I Dinur, S Goldfeder, T Halevi, Y Ishai, M Kelkar… - Advances in Cryptology …, 2021 - Springer
We study new candidates for symmetric cryptographic primitives that leverage alternation
between linear functions over Z _2 Z 2 and Z _3 Z 3 to support fast protocols for secure …

Pseudorandom isometries

P Ananth, A Gulati, F Kaleoglu, YT Lin - … on the Theory and Applications of …, 2024 - Springer
We introduce a new notion called Q-secure pseudorandom isometries (PRI). A
pseudorandom isometry is an efficient quantum circuit that maps an n-qubit state to an (n+ …

Probabilistic rank and matrix rigidity

J Alman, R Williams - Proceedings of the 49th Annual ACM SIGACT …, 2017 - dl.acm.org
We consider a notion of probabilistic rank and probabilistic sign-rank of a matrix, which
measure the extent to which a matrix can be probabilistically represented by low-rank …