#TITLE_ALTERNATIVE#
A secret sharing scheme is a method of sharing a secret among participants in a system such way that each of participants must cooperate to reveal the secret. The secret, which is the main point, is known by them as a piece of information be directly unconnected with the secret. In this paper, it wi...
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/8136 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:8136 |
---|---|
spelling |
id-itb.:81362017-09-27T11:43:03Z#TITLE_ALTERNATIVE# RAHMAWATI PUTRI (NIM 10103047), HETI Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/8136 A secret sharing scheme is a method of sharing a secret among participants in a system such way that each of participants must cooperate to reveal the secret. The secret, which is the main point, is known by them as a piece of information be directly unconnected with the secret. In this paper, it will be explained and compared four secret sharing schemes. The first one is Shamir's secret sharing schemes. The second one is secret sharing schemes based on Latin squares. The third one is secret sharing schemes based on edge-magic total graphs, and the fourth one is by Brickell's vector space. The last, secret sharing schemes based on Brickell's vector space is implemented within a program. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
A secret sharing scheme is a method of sharing a secret among participants in a system such way that each of participants must cooperate to reveal the secret. The secret, which is the main point, is known by them as a piece of information be directly unconnected with the secret. In this paper, it will be explained and compared four secret sharing schemes. The first one is Shamir's secret sharing schemes. The second one is secret sharing schemes based on Latin squares. The third one is secret sharing schemes based on edge-magic total graphs, and the fourth one is by Brickell's vector space. The last, secret sharing schemes based on Brickell's vector space is implemented within a program. |
format |
Final Project |
author |
RAHMAWATI PUTRI (NIM 10103047), HETI |
spellingShingle |
RAHMAWATI PUTRI (NIM 10103047), HETI #TITLE_ALTERNATIVE# |
author_facet |
RAHMAWATI PUTRI (NIM 10103047), HETI |
author_sort |
RAHMAWATI PUTRI (NIM 10103047), HETI |
title |
#TITLE_ALTERNATIVE# |
title_short |
#TITLE_ALTERNATIVE# |
title_full |
#TITLE_ALTERNATIVE# |
title_fullStr |
#TITLE_ALTERNATIVE# |
title_full_unstemmed |
#TITLE_ALTERNATIVE# |
title_sort |
#title_alternative# |
url |
https://digilib.itb.ac.id/gdl/view/8136 |
_version_ |
1820664336981426176 |