Secret-sharing for NP

DOI10.1007/978-3-662-45608-8_14MaRDI QIDQ2936612zbMATH OpenOpenAlexFDO

Authors Ilan Komargodski, Moni Naor, Eylon Yogev

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

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

Recommendations

• Secret-sharing for NP
• Witness encryption and its applications
• Secret sharing for mNP: completeness results
• Cutting-edge cryptography through the lens of secret sharing
• Cutting-edge cryptography through the lens of secret sharing

Cited in

(15)

• 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 on the \(d\)-dimensional cube
• Secret-sharing for NP
• Local bounds for the optimal information ratio of secret sharing schemes
• How to avoid obfuscation using witness PRFs
• Cutting-edge cryptography through the lens of secret sharing
• Secret sharing for mNP: completeness results
• How to Share a Secret, Infinitely
• Witness encryption and its applications
• Indistinguishability obfuscation
• How to share an NP statement or combiners for zero-knowledge proofs
• How to make any computational secret sharing scheme adaptively secure
• Indistinguishability obfuscation from well-founded assumptions
• Taming adaptive security and new access structures in evolving secret sharing

This page was built for publication: Secret-sharing for \(\mathbf {NP}\)

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