Adaptively secure constrained pseudorandom functions in the standard model
type: Item
instance of: scholarly article
title: Adaptively secure constrained pseudorandom functions in the standard model
zbMATH Open document ID: 1501.94038
DOI: 10.1007/978-3-030-56784-2_19
author: Alex Davidson
author: Shuichi Katsumata
author: Ryo Nishimaki
author: Shota Yamada
author: Takashi Yamakawa
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614551
zbMATH Keywords: adaptively secure CPRFs
zbMATH Keywords: collusion-resistant CPRFs
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 19
OpenAlex ID: W3013595713
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Learning with Rounding, Revisited
cites work: Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
cites work: Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
cites work: Key-Homomorphic Constrained Pseudorandom Functions
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Identity-Based (Lossy) Trapdoor Functions and Applications
cites work: Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
cites work: Private Puncturable PRFs from Standard Lattice Assumptions
cites work: Key Homomorphic PRFs and Their Applications
cites work: Constraining Pseudorandom Functions Privately
cites work: Constrained Pseudorandom Functions and Their Applications
cites work: Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
cites work: Functional Signatures and Pseudorandom Functions
cites work: Private constrained PRFs (and more) from LWE
cites work: Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
cites work: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: GGH15 beyond permutation branching programs: proofs, attacks, and candidates
cites work: Adaptive Security of Constrained PRFs
cites work: Q3729902
cites work: A Pseudorandom Generator from any One-way Function
cites work: Adaptively secure constrained pseudorandom functions
cites work: Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
cites work: Verifiable Random Functions from Weaker Assumptions
cites work: Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
cites work: Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
cites work: All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
cites work: Adaptively secure distributed PRFs from LWE
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Pseudorandom Functions and Factoring
cites work: Privately constraining and programming PRFs, the LWE way
cites work: How to use indistinguishability obfuscation
cites work: Fully secure attribute-based encryption for \(t\)-CNF from LWE
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
description: scientific article; zbMATH DE number 7614551