A Network Game Based on Fair Random Numbers(<Special Section>Cyberworlds)
スポンサーリンク
概要
- 論文の詳細を見る
A compromising technique is proposed for deterring clients from cheating by robot players in skill-based real-time network games. This technique is to inject a fair random noise into the manual input for a real-time game modeled as a chaotic dynamical system. The fair random noise is determined by means of the bit commitment protocol so that neither host nor client can control the noise in their favor. A scenario possibly plotted by a robot player for its victory may be spoiled by slight noise injection because of the sensitivity of chaotic systems to the input. The noise injection brings a luck-based factor into a skill-based game. In this sense, the technique proposed in this paper is not a solution but a compromise for the inherent problem of robot players with the skill-based network games. An example implementation of pinball is presented.
- 社団法人電子情報通信学会の論文
- 2005-05-01
著者
-
黒沢 馨
The Authors Are With The Department Of Communication And Integrated Systems Tokyo Institute Of Techn
-
黒沢 馨
Tokyo Institute Of Technology
-
KUROSAWA Kaoru
Department of Computer and Information Sciences, Ibaraki University
-
KAMADA Masaru
Department of Computer and Information Sciences, Faculty of Engineering, Ibaraki University
-
Ohtaki Yasuhiro
Department of Computer and Information Sciences, Ibaraki University
-
Kamada M
Department Of Computer And Information Sciences Ibaraki University
-
Kamada Masaru
Department Of Computer And Information Sciences Faculty Of Engineering Ibaraki University
-
Kurosawa Kaoru
Department Of Computer And Information Sciences Ibaraki University
-
OKAMOTO Shusuke
Department of Computer and Information Sciences, Ibaraki University
-
Okamoto Shusuke
Faculty Of Science And Technology Seikei University
-
Okamoto Shusuke
Department Of Computer And Information Sciences Ibaraki University
-
Ohtaki Yasuhiro
Department Of Computer And Information Sciences Ibaraki University
-
Kamada Masaru
Department Of Information And Sciences Seikei University
-
Kurosawa Kaoru
Department Of Behavioral Sciences Faculty Of Letters Chiba University
関連論文
- On the Security of a MAC by Mitchell(Symmetric Key Cryptography)(Cryptography and Information Security)
- 秘密分散共有法とその応用
- 秘密分散共有法 (特集 ネツトワ-クシステムと暗号--電子化社会の危機管理)
- Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
- 不正者に対して最も安全な秘密分散共有法
- 1995 IEEE International Symposium on Circuits and Systems
- ゼロ知識証明とマルチパーティプロトコル (<小特集>ゼロ知識証明とその応用)
- CSK/SSMA ALOHA System with Nonorthogonal Sequences(Spread Spectrum Thchnologies and Applications)(Information Theory and Its Applications)
- TMAC: Two-Key CBC MAC (Symmetric Cipher) (Cryptography and Information Security)
- TMAC : Two-Key CBC MAC
- Combinatorial Bounds and Design of Broadcast Authentication (Special Section on Discrete Mathematics and Its Applications)
- Three-Dimensional Measurement Approach for Seal Identification
- A Network Game Based on Fair Random Numbers(Cyberworlds)
- A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
- Digital/Analog Hybrid Implementation of Cardinal Spline Interpolation(Digital Signal Processing)
- Prototyping tool for Web-based multiuser online role-playing game
- Towards Secure and Fast Hash Functions (Special Section on Cryptography and Information Security)
- Towards Secure and Fast Hash Functions
- On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms(Discrete Mathematics and Its Applications)
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer (Protocol) (Cryptography and Information Security)
- Hoe to Improve Interpolation Attack(Symmetric Key Cryptography)(Cryptography and Information Security)
- Security of the Five-Round KASUMI Type Permutation
- On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
- Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k(Special Section on Cryptography and Information Security)
- Some new results on nonperfect secret sharing schemes
- Finite Method of Maximizing Convex Functions over compact Set
- Estimation of Color Images by Box Splines from Their Observation through Honeycomb Color Filter(Digital Signal Processing)
- A.C. Characteristics of the Electroviscous Effect
- Transient Pressure-Drop Fluctuatins in Electroviscous Effect
- Electroviscous Effect in Liquid Crystals
- The Electroviscous Effect in the MBBA Liquid Crystal
- Evaluation of a Dynamic Data Allocation Method for Web-Based Multi-Server MORPG System
- A Finite Algorithm for Minimizing Convex Quadratic Functions over Polyhedrons
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- New bound for affine resolvable designs and its application to authentication codes
- On Parallel Hash Functions Based on Block-Ciphers (Symmetric Cipher) (Cryptography and Information Security)
- Square Hash with a Small Key Size (Symmetric Cipher) (Cryptography and Information Security)
- k-Resilient Identity-Based Encryption in the Standard Model(Public Key Cryptography, Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackott Cipher (Symmetric Cipher) (Cryptography and Information Security)
- Construction of Orthogonal Overlapping Pulses for Impulse Radio Communications
- Design of UWB Pulses in Terms of B-Splines(Pulse Shape, Ultra Wideband Systems)
- On the Universal Hash Functions in Luby-Rackoff Cipher
- Birthday Paradox for Multi-Collisions
- Practical and Proven Zero-Knowledge Constant Round Variants of GQ and Schnorr (Special Section on Cryptography and Information Security)
- Process interactionism, process analysis, and self process : An extension of Kurt Lewin's approach to personality psychology
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer
- Square Hash with a Small Key Size
- Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions