Constrained pseudorandom functions for inner-product predicates from weaker assumptions
From MaRDI portal
Cites work
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- A theory of the learnable
- Adaptively secure constrained pseudorandom functions
- Adaptively secure constrained pseudorandom functions in the standard model
- Adaptively secure puncturable pseudorandom functions in the standard model
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- Advances in Cryptology - CRYPTO 2003
- Aggregate pseudorandom functions and connections to learning
- Breaking the circuit size barrier for secure computation under DDH
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions from homomorphic secret sharing
- Constraining pseudorandom functions privately
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Correlated pseudorandom functions from variable-density LPN
- Correlated-input secure hash functions
- Distributed Point Functions and Their Applications
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fast public-key silent OT and more from constrained Naor-Reingold
- Function secret sharing
- Functional signatures and pseudorandom functions
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Homomorphic secret sharing from lattices without FHE
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1394311 (Why is no real title available?)
- Improved constructions of PRFs secure against related-key attacks
- Improved Garbled Circuit: Free XOR Gates and Applications
- Key homomorphic PRFs and their applications
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New hash functions and their use in authentication and set equality
- Number-theoretic constructions of efficient pseudo-random functions
- On related-secret pseudorandomness
- One-One Constrained Pseudorandom Functions.
- Private constrained PRFs (and more) from LWE
- Private puncturable PRFs from standard lattice assumptions
- Privately constraining and programming PRFs, the LWE way
- Pseudorandom functions and permutations provably secure against related-key attacks
- Pseudorandom functions from LWE: RKA security and application
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- QuietOT: lightweight oblivious transfer with a public-key setup
- Reducing depth in constrained PRFs: from bit-fixing to \(\mathbf {NC}^{1}\)
- Related-key security for pseudorandom functions beyond the linear barrier
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Traceable Signature with Stepping Capabilities
- Trapdoor hash functions and their applications
Cited in
(3)
This page was built for publication: Constrained pseudorandom functions for inner-product predicates from weaker assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965324)
