Constrained pseudorandom functions from homomorphic secret sharing
From MaRDI portal
Publication:6085268
DOI10.1007/978-3-031-30620-4_7zbMath1528.94094OpenAlexW4365807544MaRDI QIDQ6085268
Geoffroy Couteau, Alain Passelègue, Mahshid Riahinia, Pierre-Jean Meyer
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_7
Cites Work
- Unnamed Item
- Private constrained PRFs (and more) from LWE
- Privately constraining and programming PRFs, the LWE way
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Adaptively secure constrained pseudorandom functions in the standard model
- Large message homomorphic secret sharing from DCR and applications
- Homomorphic secret sharing from lattices without FHE
- Efficient pseudorandom correlation generators: silent OT extension and more
- Adaptively secure constrained pseudorandom functions
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Computation from Somewhat Homomorphic Encryption
- Founding Cryptography on Oblivious Transfer – Efficiently
- A Depth-Universal Circuit
- Fully homomorphic encryption using ideal lattices
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Key-Homomorphic Constrained Pseudorandom Functions
- Functional Signatures and Pseudorandom Functions
- Constraining Pseudorandom Functions Privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- An algebraic framework for silent preprocessing with trustless setup and active security
This page was built for publication: Constrained pseudorandom functions from homomorphic secret sharing
