World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Mon, Jun 21st, 2021 at 1am (EDT)

During this period, the E-commerce and registration of new users may not be available for up to 6 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.
Code Based Secret Sharing Schemes cover

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.

Sample Chapter(s)
Foreword
Chapter 1: Foundations

Contents:

  • Foundations
  • Massey Scheme
  • Blakley Secret-Sharing Scheme
  • Alternative Schemes
  • Applications

Readership: Academics interested in Coding Theory, and Cryptography. Engineers and Researchers working in digital security. The book can form the basis for a graduate level course on the topic, to be a part of a master degre in Crypto or Computer security.

Free Access
FRONT MATTER
  • Pages:i–xv

https://doi.org/10.1142/9789811248337_fmatter

Free Access
Chapter 1: Foundations
  • Pages:1–35

https://doi.org/10.1142/9789811248337_0001

No Access
Chapter 2: Massey Scheme
  • Pages:37–80

https://doi.org/10.1142/9789811248337_0002

No Access
Chapter 3: Blakley Secret-Sharing Scheme
  • Pages:81–103

https://doi.org/10.1142/9789811248337_0003

No Access
Chapter 4: Alternative Schemes
  • Pages:105–152

https://doi.org/10.1142/9789811248337_0004

No Access
Chapter 5: Applications
  • Pages:153–195

https://doi.org/10.1142/9789811248337_0005

Free Access
BACK MATTER
  • Pages:197–198

https://doi.org/10.1142/9789811248337_bmatter

Selda Çalkavur received Doctor degree from İstanbul Kültür University, İstanbul, Turkey in 2010. She worked as an assistant professor from 2011 till 2018. She has been working as an associate professor at Kocaeli University, Kocaeli, Turkey since 2018. She has became a board member during 2011–2019, head of department since 2012, vice director during 2013–2019, director, and the chairman of the board since 2019 at Kocaeli University. Her research interests include coding theory, cryptography, and algebra. She is the author of 25 journal papers.

 

Alexis Bonnecaze received his PhD degree in computer science from the Université de Nice - Sophia Antipolis (UNSA) in 1995. During the year 1994, he was a visiting scholar at EE dept, University of Southern California, LA. From 1997 to 1998, he stayed a year and a half at the Mathematic department of RMIT, Melbourne, Australia working on some algebraic and combinatorial aspects of coding theory. In Sept 1998, he joined the University of Toulon as an assistant professor. He stayed one year at INRIA, Projet GALAAD, during the academic year 1999–2000. In 2002, he was a professor of computer science at the Internet school of Marseille, and he joined ESIL, University of Mediterranée in 2005. He visited Institut Eurécom as a délégué CNRS during the academic year 2004–2005. He is currently a member of ATI team (and head of AGLR group at I2M) and a professor at Polytech Marseille, Aix-Marseille Université. He is the author of over twenty journal papers.

 

Romar dela Cruz is an associate professor at the Institute of Mathematics, University of the Philippines Diliman. He received his BS and MS degrees in Mathematics from UP Diliman. In 2013, he obtained his PhD degree in Mathematical Sciences from Nanyang Technological University, Singapore. He is a recipient of the Georg Forster Research Fellowship (2019–2020) from the Alexander von Humboldt Foundation. His research interests include coding theory and cryptography.

 

Patrick Solé received the Ingénieur and Docteur-Ingénieur degrees both from Ecole Nationale Supérieure des Télécommunications, Paris, France, in 1984 and 1987, respectively, and the habilitation à diriger des recherches from Université de Nice-Sophia Antipolis, Sophia Antipolis, France, in 1993.

He has held visiting positions in Syracuse University, Syracuse, NY, from 1987 to 1989, Macquarie University, Sydney, Australia, from 1994 to 1996, and Lille University, Lille, France, from 1999 to 2000.

Since 1989, he has been a permanent member of the CNRS and became Directeur de Recherche in 1996. He is currently member of the CNRS lab I2M, Marseilles, France.

He is the author of over 200 journal papers and of four books.

Sample Chapter(s)
Foreword
Chapter 1: Foundations