NIKE from affine determinant programs

DOI10.1007/978-3-030-90402-9_6OpenAlexW3210047294MaRDI QIDQ2697912

Jim Barthel, Răzvan Roşie

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90402-9_6

zbMATH Keywords

ADPbranching programsNIKE

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Towards optimal simulations of formulas by bounded-width programs
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• A one round protocol for tripartite Diffie-Hellman
• How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
• New directions in cryptography
• Candidate Multilinear Maps from Ideal Lattices
• Private Puncturable PRFs from Standard Lattice Assumptions

This page was built for publication: NIKE from affine determinant programs