Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Author： Martin Keith  

Publisher： Springer Publishing Company

ISSN： 1936-2447

Source： Cryptography and Communications, Vol.3, Iss.2, 2011-06, pp. : 65-86

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A practical strongly secure one‐round authenticated key exchange protocol without random oracles

By  

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 6, 2015-04 ,pp. : 1118-1131

John Wiley & Sons Inc

Access to resources Recommend Favorite

How to Win at (One-Round) War

By  

The College Mathematics Journal, Vol. 46, Iss. 4, 2015-09 ,pp. : 242-253

Mathematical Association of America

Access to resources Recommend Favorite

Linear Secret Sharing Schemes and Rearrangements of Access Structures

By Xiao Liang-liang   Liu Mu-lan  

Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. : 685-694

Springer Publishing Company

Access to resources Recommend Favorite

Optimal strategies for the one-round discrete Voronoi game on a line

By Banik Aritra   Bhattacharya Bhaswar   Das Sandip  

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 655-669

Springer Publishing Company

Access to resources Recommend Favorite

Perfectly Secure Key Distribution for Dynamic Conferences

By Blundo C.   de Santis A.   Herzberg A.   Kutten S.   Vaccaro U.   Yung M.  

Information and Computation, Vol. 146, Iss. 1, 1998-10 ,pp. : 1-23

Academic Press

Access to resources Recommend Favorite