跳到主要內容

臺灣博碩士論文加值系統

(3.236.124.56) 您好!臺灣時間:2021/07/28 09:27
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:Rini Deviani
研究生(外文):Rini Deviani
論文名稱:RSA Time-Lock Puzzle Authenticated E-voting System
論文名稱(外文):RSA Time-Lock Puzzle Authenticated E-voting System
指導教授:陳興忠
指導教授(外文):Chen,Hsing-Chung
口試委員:王居尉陳啟東陳興忠
口試委員(外文):Wang, Gyu-WeiChen, Chi-TungChen,Hsing-Chung
口試日期:12 July 2012
學位類別:碩士
校院名稱:亞洲大學
系所名稱:資訊工程學系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:英文
論文頁數:45
中文關鍵詞:RSAtime-releasetime-lock puzzlecryptographyauthenticationelectronic voting
外文關鍵詞:RSAtime-releasetime-lock puzzlecryptographyauthenticationelectronic voting
相關次數:
  • 被引用被引用:0
  • 點閱點閱:716
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
The main principle of e-voting is that it must be as similar to regular voting as possible, compliant with election legislation and principles and be at least as secure as regular voting. Therefore, e-voting must be uniform and secret, only eligible persons must be allowed to (e-) vote. Every voter should be able to cast only one vote; a voter must not be able to prove in favor of whom he/she voted. In addition to this the collecting of votes must be secure, reliable and accountable. In the term of Timed-Release Cryptography, e-voting is intended to prevent the early opening of electronically-case votes. It also avoids election fraud which means that all parties involved do not have access to the results until a specific, predefined time in the future. In this thesis, we propose an RSA time-lock puzzle authenticated e-voting system. Authentication, here, means to provide public key based authenticated encryption algorithm that takes sender’s secret key, receiver’s public key and designated time so that the resulting ciphertext can be decrypted only by receiver and only starting with designated time using receiver’s secret key, sender’s public key and some secret that will be disclosed only on designated time. RSA as one of the most famous cryptosystem is used and secure related to several main security issues.
The main principle of e-voting is that it must be as similar to regular voting as possible, compliant with election legislation and principles and be at least as secure as regular voting. Therefore, e-voting must be uniform and secret, only eligible persons must be allowed to (e-) vote. Every voter should be able to cast only one vote; a voter must not be able to prove in favor of whom he/she voted. In addition to this the collecting of votes must be secure, reliable and accountable. In the term of Timed-Release Cryptography, e-voting is intended to prevent the early opening of electronically-case votes. It also avoids election fraud which means that all parties involved do not have access to the results until a specific, predefined time in the future. In this thesis, we propose an RSA time-lock puzzle authenticated e-voting system. Authentication, here, means to provide public key based authenticated encryption algorithm that takes sender’s secret key, receiver’s public key and designated time so that the resulting ciphertext can be decrypted only by receiver and only starting with designated time using receiver’s secret key, sender’s public key and some secret that will be disclosed only on designated time. RSA as one of the most famous cryptosystem is used and secure related to several main security issues.
Abstract i
Table of Contents ii
List of Figures iii
Chapter 1 Introduction 1
1.1 Motivation 1
1.2 Outline of Thesis 3
1.3 Notations 3
Chapter 2 Literature Review 4
2.1 RSA-type Cryptosystem 4
2.2 Time-Release Encryption 5
2.3 Time-Lock Puzzle 6
2.4 RSA Time-Lock Puzzle 6
2.5 Multicast 8
2.5.1 Reliable Multicast Protocol 10
2.6 E-voting System 13
2.6.1 E-voting System Architecture 15
2.6.2 Key Management 16
Chapter 3 An E-voting Scheme Based on RSA Time-Lock Puzzle Mechanism 18
3.1 Multicast Time-Lock Puzzle Model 18
3.2 RSA Time-lock Puzzle E-Voting System 19
Chapter 4 Security Analyses & Computation Cost 28
4.1 Security Analyses 28
4.2 Computation Cost 33
Chapter 5 Conclusion and Future Work 35
References 36

[1] T. C. May, "Timed release crypto," February 1993. [Online]. Available: http://www.hks.net/cpunks/cpunks.html.
[2] R. L. Rivest, A. Shamir and D. A. Wagner, "Time-lock puzzles and timed-release Crypto," in Massachusetts Institute of Technology, Cambridge, MA, USA, Tech. Rep, 1996.
[3] Y. I. Jerschow and M. Mauve, "Offline Submission with RSA Time-Lock Puzzles," in 10th IEEE International Conference on Computer and Information Technology (CIT), Institute of Computer Science, Heinrich Heine University, D¨usseldorf, Germany, 2010.
[4] A. Rubin, "Security Considerations for Remote Electronic Voting over the Internet," AT&T Labs – Research, Florham Park, NJ, 2001.
[5] K.Chalkias, F.Baldimtsi, D.Hristu-Varsakelis and G.Stephanides, "Pairing Based Timed-Release Cryptography," Identity Based Encryption Workshop, NIST, Computational Systems and Software Engineering Laboratory, Thessaloniki, Greece, 2008.
[6] R. L. Rivest, A. Shamir and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, vol. 21, no. 2, pp. 120 - 126, 1978.
[7] [Online]. Available: http://cseweb.ucsd.edu/~spanjwan/multicast.html.
[8] K. Emura, A. Miyaji and K. Omote, "A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication," ProvSec 2010, LNCS 6402, p. 200–213, 2010.
[9] B. Quinn, "IP Multicast Applications:Challenges & Solutions," September 2001.
[10] J. M. DeLaurentis, "A further weakness in the common modulus protocol for the RSA cryptoalgorithm," Cryptologia, p. 253–259, 1984.
[11] G. L. Miller, "Riemann’s hypothesis and tests for primality," Journal of Computer and Systems Sciences, p. 300–317, 1976.
[12] D. Boneh, "Twenty Years of Attacks on the RSA Cryptosystem".
[13] M. Wiener, "Cryptanalysis of short RSA secret exponents," IEEE Trans. on Inform. Theory, vol. 36, no. 3, p. 553–558, 1990.
[14] D. Boneh and G. Durfee, "Cryptanalysis of RSA with private key d less than N0.292," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1339-1349, 2000.
[15] R. L. Rivest and B. Kaliski, "RSA Problem," MIT Laboratory for Computer Science, 2003.
[16] Y. Desmedt and A. M. Odlyzko, "A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes," in Proc. CRYPTO ’85, Springer, 1986, p. 516–522.
[17] M. Bellare and P. Rogaway, "Optimal asymmetric encryption- how to encrypt with RSA," in Proc. Eurocrypt, Springer-Verlag, 1994, p. 92–111.
[18] E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern, "RSA-OAEP is secure under the RSA assumption," Journal of Cryptology, vol. 17, no. 2, p. 81–104, 2004.
[19] T. Okamoto and D. Pointcheval, "REACT: Rapid enhanced-security asymmetric cryptosystem transform," in Proc. Cryptographers’ Track RSA Conference (CT-RSA), Springer, 2001, p. 159–175.
[20] V. Shoup, "A Proposal for an ISO Standard for Public Key Encryption," 20 December 2001. [Online]. Available: http://shoup.net/papers/.
[21] M. Bellare and P. Rogaway, "The exact security of digital signatures—how to sign with RSA and Rabin," in Proc. Eurocrypt, Springer-Verlag, 1996, p. 399–416.
[22] R. Gennaro, S. Halevi and T. Rabin, "Secure hash-and-sign signatures without the random oracle," in Proc. Eurocrypt, Springer-Verlag, 1999, p. 123–139.
[23] D. Bleichenbacher, "Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1," in CRYPTO’98, LNCS 1462, Berlin Heidelberg, Springer-Verlag, 1998, pp. 1-12.
[24] Tallin, "Estonian e-voting system," 2005.
[25] H.-C. Chen, S.-J. Wang and J.-H. Wen, "Packet construction for secure conference call request in ad hoc network systems," ScienceDirect Information Sciences , vol. 177, p. 5598–5610, 2007.
[26] T. Kohno, A. Stubblefield, A. D. Rubin and D. S. Wallach, "Analysis of an Electronic Voting System," in IEEE Symposium on Security and Privacy, 2004.
[27] D. Wallner, E. Harder and R. Agee, "Key Management for Multicast: Issues and Architectures," 1999.
[28] J.-M. Chang and N. F. Maxemchuk, "Reliable Broadcast Protocols," ACM Transactions on Computer System, vol. 2, no. 3, pp. 251-273, 1984.
[29] M. Joye, "Security Analysis of RSA-type Cryptosystem," UCL Crypto Group, Universite Catholique de Louvain, 1997.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊