Constrained (Verifiable) Pseudorandom Function from Functional Encryption

DOI10.1007/978-3-319-99807-7_9zbMath1518.94053OpenAlexW2891331077MaRDI QIDQ6163657

Pratish Datta

Publication date: 30 June 2023

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99807-7_9

zbMATH Keywords

functional encryptionpolynomial hardnessconstrained pseudorandom functionconstrained verifiable pseudorandom function

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Constrained pseudorandom functions from functional encryption

Cites Work

• Constrained PRFs for Unbounded Inputs
• Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Constrained PRFs for Unbounded Inputs with Short Keys
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• Practical Multilinear Maps over the Integers
• Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
• Constrained Pseudorandom Functions and Their Applications
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Constrained Verifiable Random Functions
• Adaptive Security of Constrained PRFs
• Functional Encryption: Definitions and Challenges
• Single-Key to Multi-Key Functional Encryption with Polynomial Loss
• Predicate Encryption for Circuits from LWE
• A Punctured Programming Approach to Adaptively Secure Functional Encryption
• Indistinguishability Obfuscation from Compact Functional Encryption
• Candidate Multilinear Maps from Ideal Lattices
• How to use indistinguishability obfuscation
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
• Key-Homomorphic Constrained Pseudorandom Functions
• Breaking the Sub-Exponential Barrier in Obfustopia
• Functional Signatures and Pseudorandom Functions
• Advances in Cryptology - CRYPTO 2003
• Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
• Constraining Pseudorandom Functions Privately
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Constrained Pseudorandom Functions for Unconstrained Inputs

This page was built for publication: Constrained (Verifiable) Pseudorandom Function from Functional Encryption