ppt aljabar shamir secret sharing.pptx
DESCRIPTION
Contoh penerapan Aljabar dalam kehidupan sehari-hari. Salah satunya adalah Shamir Secret SharingTRANSCRIPT
![Page 1: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/1.jpg)
Shamir’s Secret SharingA Simple Applications of Polynomial Ring to Protect Your Secret
![Page 2: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/2.jpg)
Motivation It is not a good idea to keep the whole secret alone Especially if it is highly sensitive and highly important.
The way to solve this problem is to divide the original secret into parts.
Actually, there is a rules to divide the original secret and to reconstruct the original secret. Mathematics is important here.
Then, how we divide the secret so that it will increase the security of the original secret?
![Page 3: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/3.jpg)
Secret Sharing Informally, Secret sharing is any method for distributing a secret amongst a group of individuals (shareholders) each of which is allocated some information (share) related to the secret.
(Adi Shamir & George Blakley, 1979)
The secret can only be reconstructed when the shares are combined together.
Individual shares are of no use on their own.
Before we talk about Shamir’s secret sharing, lets see about this scheme first.
![Page 4: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/4.jpg)
Threshold Scheme The purpose of this scheme is to divide a secret into shares such that:
1. The reconstruction of secret requires a knowledge of or more shares.
2. A knowledge of or less shares leaves the secret completely undetermined.
This scheme is called the -threshold scheme and is the threshold value
![Page 5: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/5.jpg)
Shamir’s Secret Sharing The main idea is: two points are sufficient to define a line, 3 points are sufficient to define a parabola, 4 points to define a cubic curve and so forth
That is, points are sufficient to define a polynomial of degree .
Shamir’s secret sharing scheme is a -threshold scheme based from polynomial interpolation.
![Page 6: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/6.jpg)
Instead of sharing the random numbers, Shamir’s secret sharing scheme generate a polynomial
from random numbers which is an elements of finite field of size and again where is prime numbers.
Usually the finite field is used.
![Page 7: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/7.jpg)
How to Share Recall the polynomial over
Suppose that the secret to be divided into shares. Then, compute
for So we have an ordered pairs of points , which is the shares, to be distributed to participants or shareholders.
![Page 8: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/8.jpg)
![Page 9: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/9.jpg)
How to Reconstruct the Secret Let contain exactly elements Formalizing the Lagrange interpolation over a finite field. Let for
Thus
is the original secret.
![Page 10: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/10.jpg)
Example Let and the threshold value be Choose at random and in . For example and Now we have over Then generate as many share as we wish. For example if we have
![Page 11: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/11.jpg)
Suppose we have shares then we can reconstruct the secret from
over . Hence,
![Page 12: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/12.jpg)
Observation Properties:
1. Information theoretically secure2. Make us of Lagrange interpolation3. Space efficient
Advantages:1. Keeping fixed, shares can be easily added or removed without affecting other share2. It is easy to change the shares3. It is possible to provide more than one share per individual: hierarchy
![Page 13: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/13.jpg)
Problems1. If the participants cheat in reconstruction of secret, the secret
cannot be recovered. That is, every persons/parties should tell the truth or the secret can not be reconstructed.
2. The scheme is one-time.3. The scheme only allows revealing a secret, not computing with it.
![Page 14: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/14.jpg)
Another Scheme Verifiable Secret Sharing (VSS) could fix the first problem above. Proactive Secret Sharing: periodically renew the shares (from Shamir’s scheme) without changing the secret S.
![Page 15: PPT Aljabar Shamir Secret Sharing.pptx](https://reader033.vdocuments.site/reader033/viewer/2022061522/5695d0a01a28ab9b029337e0/html5/thumbnails/15.jpg)
Reference Munir,Rinaldi, Baratha,Addie, “Studi Dan Implementasi Clustering Penerima Kunci Dengan Metode Shamir Secret Sharing Advanced”
http://informatika.stei.itb.ac.id/~rinaldi.munir/TA/Makalah_TA%20Addie%20Barata.pdf . Tanggal akses: 26 Mei 2015
Zanin,Giorgio, “Secret Sharing Schemes and their Applications”http://wwwusers.di.uniroma1.it/smart/ppt/zanin.pdf . Tanggal akses: 21 Mei 2015
http://www.cs.berkeley.edu/~daw/teaching/cs276-s04/22.pdf . Tanggal akses: 29 Mei 2015http://scholarworks.uno.edu/cgi/viewcontent.cgi?article=2314&context=td . Tanggal akses: 30 Mei 2015