publication . Preprint . 2013

Probabilistic Infinite Secret Sharing

Name: Probabilistic Infinite Secret Sharing
Creator: Csirmaz, László

Csirmaz, László;

Open Access English

Published: 28 Oct 2013

Summary
references
17

Abstract

The study of probabilistic secret sharing schemes using arbitrary probability spaces and possibly infinite number of participants lets us investigate abstract properties of such schemes. It highlights important properties, explains why certain definitions work better than others, connects this topic to other branches of mathematics, and might yield new design paradigms. A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions for qualified subsets. The scheme is measurable if the recovery functions are measurable. Depending on how much information an unqualified...

Subjects

free text keywords: Computer Science - Cryptography and Security, Computer Science - Information Theory, Mathematics - Probability, 60B05, 94A62, 46C99, 54D10

Related Organizations

Central European University

Download from

arXiv.org e-Print Archive

Preprint . 2013

Provider: arXiv.org e-Print Archive

17 references, page 1 of 2

[1] Jacques Azma, Marc Yor, Paul Meyer, and Thierry de la Rue. Espaces de Lebesgue. In Sminaire de Probabilits XXVII, volume 1557 of Lecture Notes in Mathematics, pages 15-21. Springer Berlin / Heidelberg, 1993. 10.1007/BFb0087958.

[2] Amos Beimel. Secret-sharing schemes: A survey. In Yeow Meng Chee, Zhenbo Guo, San Ling, Fengjing Shao, Yuansheng Tang, Huaxiong Wang, and Chaoping Xing, editors, IWCC, volume 6639 of Lecture Notes in Computer Science, pages 11-46. Springer, 2011. [OpenAIRE]

[3] G. R. Blakley and Laif Swanson. Infinite structures in information theory. In CRYPTO, pages 39-50, 1982.

[4] J. T. Chang and D. Pollard. Conditioning as disintegration. Statistica Neerlandica, 51(3):287- 317, 1997.

[5] B. Chor and E. Kushilevitz. Secret sharing over infinite domain. Journal of Cryptology, 6(2):97-86, 1993.

[6] Alexander Dibert. Generalized secret sharing. Master's thesis, Central European University, Budapest, Hungary, 2011.

[7] Alexander Dibert and Laszlo Csirmaz. Infinite secret sharing - exmples. 2012. manuscript.

[8] J Haezendonck. Abstract Lebesgue-Rokhlin spaces. Bulletin de la Societe Mathematique de Belgique, 25:243-258, 1973.

[9] S. Janson. Gaussian Hilbert Spaces. Cambridge Tracts in Mathematics. Cambridge University Press, 1997.

[10] O. Kallenberg. Foundations of Modern Probability. Probability and Its Applications Series. Springer, 2010.

[11] Mauricio Karchmer and Avi Wigderson. On span programs. In Structure in Complexity Theory Conference, pages 102-111, 1993.

[12] Boshra H. Makar. Transfinite cryptography. Cryptologia, 4(4):230-237, October 1980.

[13] Jacques Patarin. Transfinite cryptography. IJUC, 8(1):61-72, 2012. also avaiable as http://eprint.iacr.org/2010/001.

[14] Raphael Phan and Serge Vaudenay. On the impossibility of strong encryption over ℵ0. In Yeow Chee, Chao Li, San Ling, Huaxiong Wang, and Chaoping Xing, editors, Coding and Cryptology, volume 5557 of Lecture Notes in Computer Science, pages 202-218. Springer Berlin / Heidelberg, 2009.

[15] Vladimir A. Rokhlin. On the fundamental ideas of measure theory. Translations (American Mathematical Society), 10:154, 1962.

17 references, page 1 of 2

Any information missing or wrong?Report an Issue