NIKE from affine determinant programs (Q2697912)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	NIKE from affine determinant programs	scientific article

Statements

scholarly article

0 references

NIKE from affine determinant programs (English)

0 references

0 references

0 references

publication date

13 April 2023

0 references

zbMATH Keywords

NIKE

0 references

branching programs

0 references

ADP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-90402-9_6

0 references

Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)

0 references

0 references

Private Puncturable PRFs from Standard Lattice Assumptions

0 references

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

0 references

Breaking the Circuit Size Barrier for Secure Computation Under DDH

0 references

Towards optimal simulations of formulas by bounded-width programs

0 references

New directions in cryptography

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)

0 references

A one round protocol for tripartite Diffie-Hellman

0 references

The complexity of computing the permanent

0 references

Identifiers

10.1007/978-3-030-90402-9_6

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2697912

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2697912&oldid=37506322"