Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
From MaRDI portal
Publication:5738765
DOI10.1007/978-3-662-54388-7_16zbMath1400.94139OpenAlexW2591108331MaRDI QIDQ5738765
Ratna Dutta, Sourav Mukhopadhyay, Pratish Datta
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_16
indistinguishability obfuscationkey delegationconstrained pseudorandom functionsverifiable constrained pseudorandom function
Related Items (4)
Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
Cites Work
- Unnamed Item
- Constrained PRFs for Unbounded Inputs
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Constrained PRFs for Unbounded Inputs with Short Keys
- Constrained Pseudorandom Functions and Their Applications
- Constrained Verifiable Random Functions
- Adaptive Security of Constrained PRFs
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Delegating RAM Computations with Adaptive Soundness and Privacy
- How to use indistinguishability obfuscation
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Key-Homomorphic Constrained Pseudorandom Functions
- Functional Signatures and Pseudorandom Functions
- Policy-Based Signatures
- Constrained Pseudorandom Functions for Unconstrained Inputs
This page was built for publication: Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation
