Jump to main content
博士論文

Secure multi-party computation based on (k,n) threshold secret sharing with n<2k-1 and application into searchable encryption

Icons representing 博士論文
The cover of this title could differ from library to library. Link to Help Page

Secure multi-party computation based on (k,n) threshold secret sharing with n<2k-1 and application into searchable encryption

Persistent ID (NDL)
info:ndljp/pid/12358656
Material type
博士論文
Author
Ahmad Akmal Aminuddin bin Mohd Kamal
Publisher
Ahmad Akmal Aminuddin bin Mohd Kamal
Publication date
2022
Material Format
Digital
Capacity, size, etc.
-
Name of awarding university/degree
東京理科大学,博士(工学)
View All

Notes on use at the National Diet Library

本資料は、掲載誌(URI)等のリンク先にある学位授与機関のWebサイトやCiNii DissertationsLeave the NDL website. から、本文を自由に閲覧できる場合があります。

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type
博士論文
Author/Editor
Ahmad Akmal Aminuddin bin Mohd Kamal
Publication, Distribution, etc.
Publication Date
2022
Publication Date (W3CDTF)
2022
Alternative Title
n<2k-1における (k,n) 閾値秘密分散法を用いた秘密計算法及び秘匿検索への応用
Degree grantor/type
東京理科大学
Date Granted
2022-03-19
Date Granted (W3CDTF)
2022-03-19