Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, Yunen
dc.identifier.citationZhang, Y. (2012). Rational secret sharing. Doctoral thesis, Nanyang Technological University, Singapore.en
dc.description.abstractThis thesis contains three main contributions as follows. First, we propose an information theoretically secure $t$-out-of-$n$ rational secret sharing scheme based on symmetric bivariate polynomials, which induces a Nash equilibrium surviving the iterated elimination of weakly dominated strategies. Second, we propose an efficient protocol for rational $t$-out-of-$n$ secret sharing based on the Chinese Remainder Theorem. Under some computational assumptions related to the discrete logarithm problem and RSA, this construction leads to a $(t-1)$-resilient computational strict Nash equilibrium that is stable with respect to trembles. Finally, we give transformations from any (classical) linear secret sharing scheme to a rational secret sharing scheme with a mediator. The rational secret sharing scheme obtained induces a Nash equilibrium surviving iterated deletion of weakly dominated strategies with resilience to any subset in the adversary structure, relies on no cryptographic assumption and provides information-theoretic security.en
dc.format.extent156 p.en
dc.subjectDRNTU::Science::Mathematics::Discrete mathematics::Cryptographyen
dc.titleRational secret sharingen
dc.contributor.supervisorWang Huaxiongen
dc.contributor.supervisorWu Guohuaen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen
dc.description.degreeDOCTOR OF PHILOSOPHY (SPMS)en
item.fulltextWith Fulltext-
Appears in Collections:SPMS Theses
Files in This Item:
File Description SizeFormat 
TSPMSG0702747J.pdfMain article958.46 kBAdobe PDFThumbnail
TSPMSG0702747J.pdfMain article958.46 kBAdobe PDFThumbnail

Google ScholarTM



Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.