Header menu link for other important links
X
Secret sharing for mNP: Completeness results
, Kannan Srinathan
Published in Springer Verlag
2016
Volume: 10095 LNCS
   
Pages: 380 - 390
Abstract
We show completeness results for secret sharing schemes realizing mNP access structures. We begin by proposing a new, Euclidean-type, division technique for access structures. Using this new technique we obtain several results in characterizing access structures for efficient (unconditionally secure) secret sharing schemes: – We show a useful transformation that achieves efficient schemes for complex access structures using schemes realizing simple access structures. – We show that, assuming every access structure in P ∩ mono admits efficient secret sharing, the existence of an efficient secret sharing for an access structure in mNP that is also complete for mNP under Karp/Levin monotone-reductions implies secret sharing schemes for all of mNP. – We finally improve upon the above completeness result by obtaining the same under ordinary Karp/Levin reductions.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
ISSN16113349
Open AccessNo