Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation

DOI10.1007/978-3-662-54388-7_16MaRDI QIDQ5738765zbMATH OpenOpenAlexFDO

Authors Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay

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

zbMATH Keywords

constrained pseudorandom functionsindistinguishability obfuscationkey delegationverifiable constrained pseudorandom function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• Constrained (Verifiable) Pseudorandom Function from Functional Encryption
• Adaptively secure constrained pseudorandom functions in the standard model
• Constrained pseudorandom functions from functional encryption
• Constrained PRFs for unbounded inputs with short keys

Cites work

• Adaptive Security of Constrained PRFs
• Adaptively secure puncturable pseudorandom functions in the standard model
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
• Constrained PRFs for unbounded inputs
• Constrained PRFs for unbounded inputs with short keys
• Constrained pseudorandom functions and their applications
• Constrained Pseudorandom Functions for Unconstrained Inputs
• Constrained verifiable random functions
• Delegating RAM computations with adaptive soundness and privacy
• Functional signatures and pseudorandom functions
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• Indistinguishability obfuscation for Turing machines with unbounded memory
• Key-homomorphic constrained pseudorandom functions
• New realizations of somewhere statistically binding hashing and positional accumulators
• On the communication complexity of secure function evaluation with long output
• Policy-Based Signatures

Cited in

(6)

• Constrained pseudorandom functions from functional encryption
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• Constrained Pseudorandom Functions for Unconstrained Inputs
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
• Constrained (Verifiable) Pseudorandom Function from Functional Encryption
• Constrained verifiable random functions without obfuscation and friends

This page was built for publication: Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738765)