Personal Entropy from Graphical Passwords : Methods for Quantification and Practical Key Generation(Cryptography and Information Security)(<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In many cryptosystems incorporating human beings, the users' limited memories and their indifference to keeping the systems secure may cause some severe vulnerability of the whole systems. Thus we need more studies on personal entropy, from an information theoretical point of view, to capture the characteristics of human beings as special information sources for cryptosystems. In this paper, we discuss and analyze the use of personal entropy for generating cryptographic keys. In such a case, it is crucially important to precisely evaluate the amount of personal entropy that indicates the actual key length. We propose an advanced key generation scheme based on the conventional graphical passwords proposed in [12]. We improve them to make the most of the secret information extracted in one drawing, i.e., we incorporate the on-line pen pressure and pen inclination information in addition to utilize more secret information. We call the scheme dynamic graphical passwords, and propose a practical construction of them. We also show a precise way of quantifying their entropy, and finally, as an experimental result, we can generate a key of over 110-bit long, using the data of a single drawing. When quantifying their entropy, we need to precisely evaluate the entropy of graphical passwords as well as that of the on-line information of pen movements. We need to precisely evaluate the entropy of graphical passwords by considering the users' biased choices of their graphical passwords. It is expected that they tend to choose their passwords that are memorable as easily as possible, thus we quantify the burden of memorizing each graphical password by the length of its description using a special language based on [12]. We improve the approach in [12] by more directly reflecting how easily each graphical password can be memorized.
- 社団法人電子情報通信学会の論文
- 2004-10-01
著者
-
IMAI Hideki
Chuo University
-
Imai H
Research Center For Information Security (rcis):national Institute Of Advanced Industrial Science An
-
IMAI Hideki
Institute of Industrial Science, The University of Tokyo
-
HANAOKA Goichiro
Institute of Industrial Science, The University of Tokyo
-
Hanaoka Goichiro
Institute Of Industrial Science The University Of Tokyo
-
Hanaoka Goichiro
3rd Department Institute Of Industrial Science The University Of Tokyo
-
Imai H
Chuo University
-
Imai H
Univ. Tokyo Tokyo
-
Imai Hideki
Institute Of Industrial Science The University Of Tokyo
-
AKAO Masato
Institute of Industrial Science, the University of Tokyo
-
YAMANAKA Shinji
Institute of Industrial Science, the University of Tokyo
-
Hanaoka G
National Institute Of Advanced Industrial Science And Technology
-
Yamanaka Shinji
Institute Of Industrial Science The University Of Tokyo:(present Address)corporate Research & De
-
Akao Masato
Institute Of Industrial Science The University Of Tokyo
-
Imai Hideki
Institute Of Industrial Science Interfaculty Initiative For Information Studies University Of Tokyo
関連論文
- Anonymous Password-Authenticated Key Exchange: New Construction and Its Extensions
- Efficient Algorithms for Tate Pairing(Elliptic Curve Cryptography, Cryptography and Information Security)
- Information Theoretical Secure Oblivious Polynomial Evaluation : Model, Bounds and Constructions
- Extension of Broadcasting Service by Using Electronic Tokens(Contents Technology and Web Information Systems)
- Traitor Tracing Scheme Secure against Adaptive Key Exposure and its Application to Anywhere TV Service(Discrete Mathematics and Its Applications)
- Coded Modulation for Satellite Broadcasting Based on Unconventional Partitionings (Special Section on Information Theory and Its Applications)
- Unconditionally Secure Chaffing-and-Winnowing
- Shared Pseudo-Random Secret Generation Protocols (Special Section on Discrete Mathematics and Its Applications)
- Efficient and Secure Multiparty Generation of Digital Signatures Based on Discrete Logarithms (Special Section on Discrete Mathematics and Its Applications)
- Smallest Size of Circulant Matrix for Regular (3, L) and (4, L) Quasi-Cyclic LDPC Codes with Girth 6
- An RSA-Based Leakage-Resilient Authenticated Key Exchange Protocol Secure against Replacement Attacks, and Its Extensions
- Anonymous Password-Authenticated Key Exchange : New Construction and Its Extensions
- A Secure Construction for Threshold Anonymous Password-Authenticated Key Exchange
- A New Security Architecture for Personal Networks and Its Performance Evaluation
- RSA-Based Password-Authenticated Key Exchange, Revisited
- A Secure Authenticated Key Exchange Protocol for Credential Services
- An Efficient and Leakage-Resilient RSA-Based Authenticated Key Exchange Protocol with Tight Security Reduction(Information Security)
- New Security Architecture for Mobile IPv6 Networks
- Notes on Formal Methods Used for Verification of the Security Properties of Protocols Used in Wireless Environment
- A Leakage-Resilient Network Storage System
- Security Analysis of Password-based Protocols via FDR and AVISPA
- A Simple Leakage-Resilient Authenticated Key Establishment Protocol, Its Extensions, and Applications(Information Security)
- An Efficient Leakage-Resilient Authenticated Key Exchange Protocol
- A Secure and Lightweight Authenticated Key Exchange Protocol for Wireless Networks
- Lightweight Privacy-Preserving Authentication Protocols Secure against Active Attack in an Asymmetric Way
- Asymmetric RFID System Secure against Active Attack
- The MAC-based Construction of Strong Multiple Encryption
- Efficient Strong Multiple Encryption from Relaxed Conditions
- ID-based Encryption for Directed Acyclic Graph Hierarchies : Unification of Key-evolving Encryption Primitives (Extended Abstract)
- Shielding Asymmetric Cryptosystems from Decryption Failures
- A Bandwidth-Saving Public Key Encryption Conversion Scheme
- Towards Removing Random Oracles from OAEP
- Best Truncated and Impossible Differentials of Feistel Block Ciphers with S-D (Substitution and Diffusion) or D-S Round Functions(Special Section on Cryptography and Information Security)
- An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation
- Birthday Paradox Based Security Analysis of Certain Broadcast Encryption Schemes(Information Security)
- A Novel Approach to Algebraic and Fast Correlation Attacks for Cryptanalysis of Certain Keystream Generators
- CCA-Secure Public Key Encryption without Group-Dependent Hash Functions
- Formal Security Treatments for IBE-to-Signature Transformation : Relations among Security Notions
- A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions
- Key-Insulated Public Key Encryption with Auxiliary Helper Key : Model, Constructions and Formal Security Proofs(Information Theory and Its Applications)
- Efficient Identity-Based Encryption with Tight Security Reduction(Information Theory and Its Applications)
- A New Key-Insulated Public Key Encryption Scheme with Auxiliary Helper Key
- Security Tightness Evaluation of Fujisaki-Okamoto Conversion in Identity Based Encryption
- Searchable Public-key Broadcast Encryption
- Relations among Notions of Security for Identity Based Encryption Schemes (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
- Towards Security Enhancement with Efficient Reduction for Identity Based Encryption
- CCA-secure IBE Scheme with Tight Security Reduction based on the Gap BDH Assumption
- A Remark on GEM
- An Implementation of KPS with Distributed Trust
- Compact Encoding of the Web Graph Exploiting Various Power Distributions(Discrete Mathematics and Its Applications)
- Sliced Onion Routing Scheme and its Aptitude for Sender-Identifiable Environments
- A New Anonymous Routing Scheme and its Aptitude for Ad-hoc Networks
- Subset Incremental Chain Based Broadcast Encryption with Shorter Ciphertext
- Optimally Mastering Keys in Various Broadcast Encryption Schemes
- Personal Entropy from Graphical Passwords : Methods for Quantification and Practical Key Generation(Cryptography and Information Security)(Information Theory and Its Applications)
- Finding Neighbor Communities in the Web Using an Inter-Site Graph(Database)
- Managing Encryption and Key Publication Independently in Digital Rights Management Systems (Applications) (Cryptography and Information Security)
- On Evaluating the Entropy of Graphical Passwords
- Discussions on Unconditionally Secure VSS Robust against Dishonest Majority
- Discussions on Unconditionally Secure VSS Robust against Dishonest Majority
- An Unconditionally Secure Electronic Cash Scheme with Computational Untraceability(Special Section on Cryptography and Information Security)
- A Digital Signature Scheme on ID-Based Key-Sharing Infrastructures : Special Section on Cryptography and Information Security
- Implementation of an Industrial R/C System Using a Hybrid DS/FH Spread Spectrum Technique (Special Issue on Spread Spectrum Techniques and Applications)
- Unconditionally Secure Authenticated Encryption(Discrete Mathematics and Its Applications)
- Efficient Unconditionally Secure Digital Signatures (Asymmetric Cipher) (Cryptography and Information Security)
- Efficient Unconditionally Secure Digital Signatures
- A Traitor Traceable Conference System with Dynamic Sender(Special Section on Cryptography and Information Security)
- Efficient Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code
- Improving the Secure Electronic Transaction Protocol by Using Signcryption
- Optimal Unconditionally Secure ID-Based Key Distribution Scheme for Large-Scaled Networks : Special Section on Cryptography and Information Security
- An Optimization of Credit-Based Payment for Electronic Toll Collection Systems
- On the oblivious transfer capacity of the erasure channel
- MFSK/FH-CDMA System with Two-Stage Address Coding and Error Correcting Coding and Decoding
- An Error-Controlling Scheme according to the Importance of Individual Segments of Model-Based Coded Facial Images (Special Section on Information Theory and Its Applications)
- Variable Error Controlling Schemes for Intelligent Error Controlling Systems (Special Section on Information Theory and Its Applications)
- A Provably Secure Refreshable Partially Anonymous Token and Its Applications(Discrete Mathematics and Its Applications)
- An Efficient Anonymous Authentication Scheme with No Unlinkability
- Traceability Schemes against Illegal Distribution of Signed Documents(Discrete Mathematics and Its Applications)
- Efficient Reliability-Based Turbo Decoding
- The Role of Arbiters for Unconditionally Secure Authentication(Discrete Mathematics and Its Applications)
- New Short Signature Scheme without Random Oracles
- Relation between the XL Algorithm and Grobner Basis Algorithms(Symmetric Key Cryptography, Cryptography and Information Security)
- An Efficient Group Signature Scheme from Bilinear Maps(Discrete Mathematics and Its Applications)
- Effect of Noisy Estimation on Turbo-Coded Modulation over Rayleigh Fading Channel
- Efficient Provider Authentication for Bidirectional Broadcasting Service
- A Trade-off Traitor Tracing Scheme
- Block Coding Scheme Based on Complementary Sequences for Multicarrier Signals
- Information-Theoretically Secure Key Insulated Encryption : Models, Bounds and Constructions(Cryptography and Information Security)(Information Theory and Its Applications)
- Integrated Co-channel Interference Cancellation and Decoding Scheme over Fading Multipath Channel for CDMA
- Quantum Bit Commitment Robust against Noise and Multiple-photons
- A Simple Method to Control Indirect Information Flows (Special Section of Letters Selected from the 1994 IEICE Spring Conference)
- Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
- Security Analysis of Two Augmented Password-Authenticated Key Exchange Protocols
- Multilevel RLL (D, K, I) Constrained Sequences (Special Section on Information Theory and Its Applications)
- Secure Architecture For Distributed Intrusion Detection Systems
- Secure Broadcast System with Simultaneous Individual Messaging
- A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing(Information Security)
- LDPC coded Hybrid Type II ARQ System
- Threshold Anonymous Password-Authenticated Key Exchange Secure against Insider Attacks
- Relations among Notions of Security for Identity Based Encryption Schemes