Secret Sharing for mNP: Completeness Results

DOI10.1007/978-3-319-49890-4_21zbMath1394.94945OpenAlexW2552821524MaRDI QIDQ3179496

Mahabir Prasad Jhanwar, Kannan Srinathan

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• The monotone circuit complexity of Boolean functions
• Secret-Sharing for NP
• Secret-Sharing Schemes: A Survey
• How to share a secret
• On the (im)possibility of obfuscating programs
• Progress in Cryptology - INDOCRYPT 2003
• Witness encryption and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secret Sharing for mNP: Completeness Results