Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765): Difference between revisions

Latest revision as of 22:40, 13 July 2024

scientific article; zbMATH DE number 6729538

Language	Label	Description	Also known as
English	Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation	scientific article; zbMATH DE number 6729538

Statements

instance of

scholarly article

0 references

title

Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

zbMATH Keywords

constrained pseudorandom functions

0 references

verifiable constrained pseudorandom function

0 references

key delegation

0 references

indistinguishability obfuscation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-54388-7_16

0 references

cites work

Constrained PRFs for Unbounded Inputs with Short Keys

0 references

Constrained PRFs for Unbounded Inputs

0 references

Delegating RAM Computations with Adaptive Soundness and Privacy

0 references

Key-Homomorphic Constrained Pseudorandom Functions

0 references

Policy-Based Signatures

0 references

Constrained Pseudorandom Functions and Their Applications

0 references

Functional Signatures and Pseudorandom Functions

0 references

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions

0 references

Constrained Pseudorandom Functions for Unconstrained Inputs

0 references

Constrained Verifiable Random Functions

0 references

Adaptive Security of Constrained PRFs

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Q3729902

0 references

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model

0 references

On the Communication Complexity of Secure Function Evaluation with Long Output

0 references

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory

0 references

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators

0 references

How to use indistinguishability obfuscation

0 references

Identifiers

zbMATH Open document ID

1400.94139

0 references

DOI

10.1007/978-3-662-54388-7_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738765

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-54388-7_16
+Normal rank
@@ Property / OpenAlex ID @@
+W2591108331
@@ Property / OpenAlex ID: W2591108331 / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained PRFs for Unbounded Inputs with Short Keys
+Normal rank
@@ Property / cites work @@
+Constrained PRFs for Unbounded Inputs
@@ Property / cites work: Constrained PRFs for Unbounded Inputs / rank @@
+Normal rank
@@ Property / cites work @@
+Delegating RAM Computations with Adaptive Soundness and Privacy
+Normal rank
@@ Property / cites work @@
+Key-Homomorphic Constrained Pseudorandom Functions
+Normal rank
@@ Property / cites work @@
+Policy-Based Signatures
@@ Property / cites work: Policy-Based Signatures / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained Pseudorandom Functions and Their Applications
+Normal rank
@@ Property / cites work @@
+Functional Signatures and Pseudorandom Functions
@@ Property / cites work: Functional Signatures and Pseudorandom Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
+Normal rank
@@ Property / cites work @@
+Constrained Pseudorandom Functions for Unconstrained Inputs
+Normal rank
@@ Property / cites work @@
+Constrained Verifiable Random Functions
@@ Property / cites work: Constrained Verifiable Random Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive Security of Constrained PRFs
@@ Property / cites work: Adaptive Security of Constrained PRFs / rank @@
+Normal rank
@@ Property / cites work @@
+Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
+Normal rank
@@ Property / cites work @@
+Q3729902
@@ Property / cites work: Q3729902 / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
+Normal rank
@@ Property / cites work @@
+On the Communication Complexity of Secure Function Evaluation with Long Output
+Normal rank
@@ Property / cites work @@
+Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
+Normal rank
@@ Property / cites work @@
+New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
+Normal rank
@@ Property / cites work @@
+How to use indistinguishability obfuscation
@@ Property / cites work: How to use indistinguishability obfuscation / rank @@
+Normal rank