Analisis Perbandingan Skema Pembagian Rahasia 3-Struktur Akses Hipergraf dan 3-Struktur Terlarang Hipergraf
| Main Authors: | I Ketut Tri Martana, author, Add author: Kiki Ariyanti Sugeng, supervisor, Add author: Djati Kerami, examiner, Add author: Sri Mardiyati, examiner |
|---|---|
| Format: | Masters Doctoral |
| Terbitan: |
, 2010
|
| Subjects: | |
| Online Access: |
https://lib.ui.ac.id/detail?id=20252398 |
| ctrlnum |
20252398 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><type>Thesis:Masters</type><title>Analisis Perbandingan Skema Pembagian Rahasia 3-Struktur Akses Hipergraf dan 3-Struktur Terlarang Hipergraf</title><creator>I Ketut Tri Martana, author</creator><creator>Add author: Kiki Ariyanti Sugeng, supervisor</creator><creator>Add author: Djati Kerami, examiner</creator><creator>Add author: Sri Mardiyati, examiner</creator><publisher/><date>2010</date><subject>Secret Sharing Scheme--Access Structures, Information Rate</subject><description>[<b>ABSTRAK</b><br>
Akses terhadap informasi rahasia perlu diatur dan dibatasi supaya tidak jatuh
kepada pihak yang tidak berkepentingan. Salah satu metode yang mengatur akses
tersebut adalah skema pembagian rahasia. Skema pembagian rahasia merupakan
suatu skema dimana hanya anggota kelompok (partisipan) dengan kualifikasi
tertentu saja yang dapat merekonstruksi informasi rahasia. Koleksi dari subset
partisipan yang berkualifikasi disebut struktur akses. Skema pembagain rahasia
yang dapat direpresentasikan dengan graf disebut sebagai skema pembagian
rahasia graphical. Skema ini dapat diperluas dengan menggunakan hipergraf,
yang merupakan bentuk lebih umum dari graf. Skema yang direpresentasikan
dengan hipergraf adalah salah satu bentuk dari skema pembagian rahasia nongraphical.
Tesis ini akan membahas mengenai perbandingan dari skema
pembagian rahasia yang berdasarkan struktur akses &#915; dan srtuktur terlarang &#8710;
pada hipergraf 3-uniform serta information rate dari kedua konstruksi skema
pembagian rahasia.
<hr>
<b>ABSTRACT</b><br>
Access for secret information shall be limited and arranged that not be accepted to
not important people. One of the method to arranged this access is secret sharing
scheme. Secret sharing scheme is a method which allow a secret to be share
among a set of participants in such a way that only qualified subsets or participant
can recover the secret. The collection of qualified subsets is called access
structure. The scheme that can be represented by graph is called graphical secret
sharing scheme. More general from graph, represented by hypergraph, is one of
the scheme called non graphical secret sharing scheme. In this thesis will presents
the comparison analysis of secret sharing scheme between access structure &#915; and
prohibited structure &#8710; based on 3-uniform hypergraph, including the information
rate of that schemes.;Access for secret information shall be limited and arranged that not be accepted to
not important people. One of the method to arranged this access is secret sharing
scheme. Secret sharing scheme is a method which allow a secret to be share
among a set of participants in such a way that only qualified subsets or participant
can recover the secret. The collection of qualified subsets is called access
structure. The scheme that can be represented by graph is called graphical secret
sharing scheme. More general from graph, represented by hypergraph, is one of
the scheme called non graphical secret sharing scheme. In this thesis will presents
the comparison analysis of secret sharing scheme between access structure &#915; and
prohibited structure &#8710; based on 3-uniform hypergraph, including the information
rate of that schemes., Access for secret information shall be limited and arranged that not be accepted to
not important people. One of the method to arranged this access is secret sharing
scheme. Secret sharing scheme is a method which allow a secret to be share
among a set of participants in such a way that only qualified subsets or participant
can recover the secret. The collection of qualified subsets is called access
structure. The scheme that can be represented by graph is called graphical secret
sharing scheme. More general from graph, represented by hypergraph, is one of
the scheme called non graphical secret sharing scheme. In this thesis will presents
the comparison analysis of secret sharing scheme between access structure &#915; and
prohibited structure &#8710; based on 3-uniform hypergraph, including the information
rate of that schemes.]</description><identifier>https://lib.ui.ac.id/detail?id=20252398</identifier><recordID>20252398</recordID></dc>
|
| format |
Thesis:Masters Thesis Thesis:Doctoral |
| author |
I Ketut Tri Martana, author Add author: Kiki Ariyanti Sugeng, supervisor Add author: Djati Kerami, examiner Add author: Sri Mardiyati, examiner |
| title |
Analisis Perbandingan Skema Pembagian Rahasia 3-Struktur Akses Hipergraf dan 3-Struktur Terlarang Hipergraf |
| publishDate |
2010 |
| topic |
Secret Sharing Scheme--Access Structures Information Rate |
| url |
https://lib.ui.ac.id/detail?id=20252398 |
| contents |
[<b>ABSTRAK</b><br>
Akses terhadap informasi rahasia perlu diatur dan dibatasi supaya tidak jatuh
kepada pihak yang tidak berkepentingan. Salah satu metode yang mengatur akses
tersebut adalah skema pembagian rahasia. Skema pembagian rahasia merupakan
suatu skema dimana hanya anggota kelompok (partisipan) dengan kualifikasi
tertentu saja yang dapat merekonstruksi informasi rahasia. Koleksi dari subset
partisipan yang berkualifikasi disebut struktur akses. Skema pembagain rahasia
yang dapat direpresentasikan dengan graf disebut sebagai skema pembagian
rahasia graphical. Skema ini dapat diperluas dengan menggunakan hipergraf,
yang merupakan bentuk lebih umum dari graf. Skema yang direpresentasikan
dengan hipergraf adalah salah satu bentuk dari skema pembagian rahasia nongraphical.
Tesis ini akan membahas mengenai perbandingan dari skema
pembagian rahasia yang berdasarkan struktur akses Γ dan srtuktur terlarang ∆
pada hipergraf 3-uniform serta information rate dari kedua konstruksi skema
pembagian rahasia.
<hr>
<b>ABSTRACT</b><br>
Access for secret information shall be limited and arranged that not be accepted to
not important people. One of the method to arranged this access is secret sharing
scheme. Secret sharing scheme is a method which allow a secret to be share
among a set of participants in such a way that only qualified subsets or participant
can recover the secret. The collection of qualified subsets is called access
structure. The scheme that can be represented by graph is called graphical secret
sharing scheme. More general from graph, represented by hypergraph, is one of
the scheme called non graphical secret sharing scheme. In this thesis will presents
the comparison analysis of secret sharing scheme between access structure Γ and
prohibited structure ∆ based on 3-uniform hypergraph, including the information
rate of that schemes.;Access for secret information shall be limited and arranged that not be accepted to
not important people. One of the method to arranged this access is secret sharing
scheme. Secret sharing scheme is a method which allow a secret to be share
among a set of participants in such a way that only qualified subsets or participant
can recover the secret. The collection of qualified subsets is called access
structure. The scheme that can be represented by graph is called graphical secret
sharing scheme. More general from graph, represented by hypergraph, is one of
the scheme called non graphical secret sharing scheme. In this thesis will presents
the comparison analysis of secret sharing scheme between access structure Γ and
prohibited structure ∆ based on 3-uniform hypergraph, including the information
rate of that schemes., Access for secret information shall be limited and arranged that not be accepted to
not important people. One of the method to arranged this access is secret sharing
scheme. Secret sharing scheme is a method which allow a secret to be share
among a set of participants in such a way that only qualified subsets or participant
can recover the secret. The collection of qualified subsets is called access
structure. The scheme that can be represented by graph is called graphical secret
sharing scheme. More general from graph, represented by hypergraph, is one of
the scheme called non graphical secret sharing scheme. In this thesis will presents
the comparison analysis of secret sharing scheme between access structure Γ and
prohibited structure ∆ based on 3-uniform hypergraph, including the information
rate of that schemes.] |
| id |
IOS18069.20252398 |
| institution |
Universitas Indonesia |
| institution_id |
51 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Indonesia |
| library_id |
492 |
| collection |
Repository Disertasi (Open) Universitas Indonesia |
| repository_id |
18069 |
| city |
KOTA DEPOK |
| province |
JAWA BARAT |
| repoId |
IOS18069 |
| first_indexed |
2022-12-14T04:21:20Z |
| last_indexed |
2022-12-14T04:21:20Z |
| recordtype |
dc |
| merged_child_boolean |
1 |
| _version_ |
1752197102149042176 |
| score |
17.538404 |