Constrained PRFs for Unbounded Inputs with Short Keys

DOI10.1007/978-3-319-39555-5_24zbMath1348.94028OpenAlexW2500248328MaRDI QIDQ2822688

Hamza Abusalah, Georg Fuchsbauer

Publication date: 4 October 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_24

zbMATH Keywords

constrained PRFsunbounded inputs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness, Constrained (Verifiable) Pseudorandom Function from Functional Encryption, Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation, Constrained pseudorandom functions from functional encryption, Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hunting of the SNARK
• Constrained PRFs for Unbounded Inputs
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Programmable Hash Functions in the Multilinear Setting
• Constrained Pseudorandom Functions and Their Applications
• Low Overhead Broadcast Encryption from Multilinear Maps
• Universal Arguments and their Applications
• How to use indistinguishability obfuscation
• Public-Coin Differing-Inputs Obfuscation and Its Applications
• Functional Signatures and Pseudorandom Functions
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• On Extractability Obfuscation