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 …
The recent development of pseudorandom correlation generators (PCG) holds tremendous promise for highly efficient MPC protocols. Among other correlations, PCGs allow for the …
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 …
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 …
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 …
Pseudorandom functions (PRFs) are one of the fundamental building blocks in cryptography. Traditionally, there have been two main approaches for PRF design: the …
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 …
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+ …
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 …