Secret-Sharing for NP

DOI10.1007/978-3-662-45608-8_14zbMATH Open1317.94119OpenAlexW2738773056MaRDI QIDQ2936612FDOQ2936612

Eylon Yogev, Ilan Komargodski, Moni Naor

Publication date: 6 January 2015

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-45608-8_14

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Cited In (10)

• Offline witness encryption with semi-adaptive security
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Secret Sharing for mNP: Completeness Results
• Secret-sharing for NP
• Cutting-Edge Cryptography Through the Lens of Secret Sharing
• How to Avoid Obfuscation Using Witness PRFs
• Indistinguishability obfuscation
• Secret sharing on the \(d\)-dimensional cube
• How to Share a Secret, Infinitely
• Local bounds for the optimal information ratio of secret sharing schemes

This page was built for publication: Secret-Sharing for NP

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