Game Optimization for RSA Signature Scheme

Yi Chuan Wang; Jian Feng Ma; Di Lu; Liu Mei Zhang

doi:10.4028/www.scientific.net/AMM.513-517.969

Paper Titles

Application of Multi-Computer Communication among Single-Chip Microcomputers on Distributed Data Acquisition
p.951

Design of Tunnel Personnel Positioning System Based on Android
p.956

Research and Development of Mobile Termination for the Steel Quality Evaluation System Based on Android
p.960

Attribute Clustering Based Collaborative Filtering
p.965

Game Optimization for RSA Signature Scheme
p.969

A Heuristic Attribute Reduction Based on Multi-Granularity Rough Set
p.973

An Improved KNN Classification Method Based on Variable Precision Rough Set
p.978

The Research of the Web Service Test Model
p.983

Automatic Manufacturing Cloud Service Composition Based on AI Plan
p.990

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Game Optimization for RSA Signature Scheme

Game Optimization for RSA Signature Scheme

Abstract:

Security and efficiency for using RSA signature scheme are critical requirements for many network applications. In this paper, we present a Game Model for RSA Signature Scheme (GMRS). By analyzing our model with information and game theory, we prove that the Nash-equilibrium is existent in GMRS. Accordingly, we propose an optimization scheme for updating the private key. The experiment result shows that, our scheme can significant promote the efficiency and ensure the security, even in the lowest risk-level case and for an adversary with unlimited computing power.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

969-972

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.969

Citation:

Cite this paper

Online since:

February 2014

Authors:

Yi Chuan Wang*, Jian Feng Ma, Di Lu, Liu Mei Zhang

Keywords:

Game Theory, Re-Keying, RSA, Signature

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Leonid R, Natan R. Better than BiBa: Short one-time signatures with fast signing and verifying[J]. Information Security and Privacy, Springer, 2002. : 144–153.

DOI: 10.1007/3-540-45450-0_11

Google Scholar

[2] http: /www. emc. com/emc-plus/rsa-labs/standards-initiatives/key-size. htm, (2013).

Google Scholar

[3] Shannon C.E. Communication Theory of Secrecy Systems[J]. Bell System Technical Journal, 1949, 28: 656–715.

DOI: 10.1002/j.1538-7305.1949.tb00928.x

Google Scholar

[4] Mihir B, Tadayoshi K. Hash function balance and its impact on birthday attacks[J]. adversaryances in CryptologyEurocrypt 2004, Springer, 2004. : 401–418.

Google Scholar

[5] Jonathan K. Bridging Game Theory and Cryptography: Recent Results and Future Directions[J]. Ran Canetti, editor, TCC, volume of Lecture Notes in Computer Science, Springer, 2008, (4948): 251–272.

DOI: 10.1007/978-3-540-78524-8_15

Google Scholar