Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. Deniable Encryption Scheme for Private Storage
 
  • Details

Deniable Encryption Scheme for Private Storage

Date Issued
2012
Date
2012
Author(s)
Fan, I-An
URI
http://ntur.lib.ntu.edu.tw//handle/246246/253920
Abstract
There are many types of threat to the data, one is the authority forces the user to give out the key or encrypted contents, and deniable encryption (DE) is designed for this. DE has different design for different scene. In multi-party connection, there’s problem for the deniability for every party. In private storage scheme, there’s problem for constant-size key. Another problem to consider is reasonable explanation, DE is used mainly for convince someone, to make the specific situation advantageous. There are two types of proof for explanation, plan-ahead and ad-hoc. The former one needs to prepare fake data in advance, and the latter one made fake data at the time of coercion. In our scheme, we use the plan-ahead type. It is important to achieve deniability even all the scheme is known for adversary. In our scheme, we use “There is at least one explanation, but there is no limit for explain” to achieve deniability. There are two phases in our scheme, the first we pack the plaintext into coordinates in multi-dimension space, and use Linear Secret Sharing Scheme (LSSS) method to pack points into cipher plane. Another phase we pack the indices of data into a tag. While giving different keys, the tag will show different indices. Using different indices and combine the cipher planes with those indices would solve different plaintext. The DE is still limited by information theory. The first phase is for scramble the proof to make every file explainable, and maintain the limit by information theory to get high filling rate (the amount of information stored in unit ciphertext). The second phase achieves deniability, this makes this stage getting bad filling rate. Compared with the first phase, the second phase has lower amount of information, therefore, the total filling rate would be closed to the first phase. This scheme is used for private storage, to make this storage to operate dynamically, we attach several data structure operations.
Subjects
Deniable encryption
Linear secret sharing scheme
Private storage
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

index.html

Size

23.27 KB

Format

HTML

Checksum

(MD5):84d35f6e6d2908b62d0261216b247dc6

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science