[PDF] Code Based Secret Sharing Schemes Applied Combinatorial Coding Theory eBook

Author : Patrick Sole
Publisher : World Scientific
Page : 215 pages
File Size : 10,9 MB
Release : 2022-04-11
Category : Computers
ISBN : 9811248346

GET BOOK

Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user has no information about the secret, but the secret can be retrieved by certain authorized coalition of users.This book is devoted to such schemes inspired by Coding Theory. The classical schemes of Shamir, Blakley, Massey are recalled. Survey is made of research in Combinatorial Coding Theory they triggered, mostly self-dual codes, and minimal codes. Applications to engineering like image processing, and key management of MANETs are highlighted.

Author : Volodia Blinovsky
Publisher : Springer Science & Business Media
Page : 128 pages
File Size : 21,89 MB
Release : 1997-08-31
Category : Technology & Engineering
ISBN : 9780792399889

GET BOOK

Asymptotic Combinatorial Coding Theory is devoted to the investigation of the combinatorial properties of transmission systems using discrete signals. The book presents results of interest to specialists in combinatorics seeking to apply combinatorial methods to problems of combinatorial coding theory. Asymptotic Combinatorial Coding Theory serves as an excellent reference for resarchers in discrete mathematics, combinatorics, and combinatorial coding theory, and may be used as a text for advanced courses on the subject.

Author : Akshay Dhananjai Degwekar
Publisher :
Page : 166 pages
File Size : 36,88 MB
Release : 2019
Category :
ISBN :

GET BOOK

Since the inception of Cryptography, Information theory and Coding theory have influenced cryptography in myriad ways including numerous information-theoretic notions of security in secret sharing, multiparty computation and statistical zero knowledge; and by providing a large toolbox used extensively in cryptography. This thesis addresses two questions in this realm: Leakage Resilience of Secret Sharing Schemes. We show that classical secret sharing schemes like Shamir secret sharing and additive secret sharing over prime order fields are leakage resilient. Leakage resilience of secret sharing schemes is closely related to locally repairable codes and our results can be viewed as impossibility results for local recovery over prime order fields. As an application of the result, we show the leakage resilience of a variant of the Goldreich-Micali-Wigderson protocol. From Laconic Statistical Zero Knowledge Proofs to Public Key Encryption. Languages with statistical zero knowledge proofs that are also average-case hard have been used to construct various cryptographic primitives. We show that hard languages with laconic SZK proofs, that is proof systems where the communication from the prover to the verifier is small, imply public key encryption.

Author : Stephan Krenn
Publisher : Springer Nature
Page : 81 pages
File Size : 45,52 MB
Release : 2023-05-25
Category : Computers
ISBN : 3031281616

GET BOOK

This book provides an introduction to secret sharing, a key technology for practical applications and higher-level cryptographic protocols. This survey analyzes existing work, and systematically presents secret sharing protocols for various adversary models. It provides intuitive as well as formal descriptions of the different types of adversaries, including their computational powers and capabilities. In addition, it then offers guidance and support in selecting the appropriate type of protocol for a given application domain, present representative protocols, and provide useful references for further reading and research. This book aims to support software developers and engineers in realizing highly secure cloud-based applications, and also provides an introduction to the field including some relevant technical background for interested students and computer scientists.

Author : Maura B. Paterson
Publisher : Springer Nature
Page : 323 pages
File Size : 12,36 MB
Release : 2021-12-14
Category : Computers
ISBN : 3030926419

GET BOOK

This book constitutes the refereed proceedings of the 18th IMA International Conference on Cryptography and Coding, IMACC 2021, held in December 2021. Due to COVID 19 pandemic the conference was held virtually. The 14 papers presented were carefully reviewed and selected from 30 submissions. The conference focuses on a diverse set of topics both in cryptography and coding theory.

Author : Keqin Feng
Publisher : Birkhauser
Page : 405 pages
File Size : 12,58 MB
Release : 2004
Category : Computers
ISBN : 9780817624293

GET BOOK

This book contains a selection of papers submitted to the Workshop on Coding, Cryptography and Combinatorics (CCC 2003). An important feature of the book are invited surveys on key topics such as Boolean functions in cryptology, correlation attacks on LFSR sequences, decoding algorithms for linear codes, LDPC codes, and towers of function fields. There are also carefully selected contributed papers on many aspects of coding theory, cryptology and combinatorics, for instance, new constructions of codes, decoding algorithms, coding bounds, digital nets, cryptanalysis of cryptosystems and other cryptographic schemes, linear complexity o sequences, cross-correlation of sequences, authentication codes, fast arithmetic for cryptosystems, capacity regions, and combinatorial tableaux. The reader will be informed about current reesearch in these very active areas. The book is of interest for postgraduate students and researchers in mathematics, computer science, information theory and electrical engineering.

Author : Raúl M Falcón
Publisher : Mdpi AG
Page : 0 pages
File Size : 26,66 MB
Release : 2022-07
Category :
ISBN : 9783036543550

GET BOOK

Novel synergies are continuously being developed among the research areas in coding theory, cryptography, combinatorial design, and combinatorial optimization. They give rise to new applications to other fields and to the real world, including algebraic geometry, artificial intelligence, communication networks, computer science, hardware and software design, design of experiments, logistics, machine learning, and scheduling or transportation networks, among others. With contributions of researchers of six different universities from five countries, this book consists of a compilation of some relevant and recent investigations concerning this area. It covers a vast range of topics, such as Hadamard matrices, quasigroups, Latin squares, secret sharing schemes, binary linear codes, hierarchical posets, computational algebra systems, lightweight cryptography, low-end embedded processors, block ciphers, and text compression.

Author : Fiona May Knoll
Publisher :
Page : pages
File Size : 35,17 MB
Release : 2013
Category :
ISBN :

GET BOOK

Abstract: In this thesis, we consider secret sharing schemes and network coding. Both of these fields are vital in today's age as secret sharing schemes are currently being implemented by government agencies and private companies, and as network coding is continuously being used for IP networks. We begin with a brief overview of linear codes. Next, we examine van Dijk's approach to realize an access structure using a linear secret sharing scheme; then we focus on a much simpler approach by Tang, Gao, and Chen. We show how this method can be used to find an optimal linear secret sharing scheme for an access structure with six participants. In the last chapter, we examine network coding and point out some similarities between secret sharing schemes and network coding. We present results from a paper by Silva and Kschischang; in particular, we present the concept of universal security and their coset coding scheme to achieve universal security.