Information Security

Name: Information Security | 16th International Conference, ISC 2013, Dallas, Texas, November 13-15, 2013, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

16th International Conference, ISC 2013, Dallas, Texas, November 13-15, 2013, Proceedings

Yvo Desmedt(Herausgeber*in)

Springer (Verlag)

Erschienen am 29. Dezember 2015

XIV, 418 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-27659-5 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
ISC 2013
Contents
Security of Operating Systems
Integrity Checking of Function Pointers in Kernel Pools via Virtual Machine Introspection
1 Introduction
2 Related Work
3 Integrity Checking for Function Pointers
3.1 Environment
3.2 HookLocator Architecture
4 Implementation
5 Evaluation
5.1 Extraction Module
5.2 Search Module
5.3 Learning Module and Pool Monitor
5.4 Performance Overhead of HookLocator
6 Conclusion
References
Lightweight Attestation and Secure Code Update for Multiple Separated Microkernel Tasks
1 Introduction
2 Related Work
3 Attestation Scenario and Attacker Model
3.1 Scenario for the Attestation of Multiple Tasks
3.2 Attacker Model
4 Microkernel-Based System Architecture with a Multi-context HSM
5 Integrity Verification of Multiple Microkernel Tasks as Basis for a Secure Code Update
5.1 Notation
5.2 Cryptographic Keys
5.3 Integrity Verification and Attestation of Multiple Tasks
5.4 Updating a Task After Verifying the Integrity of Existing Tasks
6 Security Analysis
6.1 Analysis of the Attestation Protocol
6.2 Formal Verification of the Attestation Protocol
6.3 Analysis of the Code Update Protocol
7 Conclusion
A ProVerif Code for the Attestation Mechanism
References
Secret Sharing
The Security Defect of a Multi-pixel Encoding Method
1 Introduction
2 Preliminaries
3 The Security Defect of MPEM
3.1 Our Discovery of MPEM's Security Defect
3.2 Using Variance to Explain the Above Security Defect
4 Future Researches
5 Conclusions
References
Encrypted Secret Sharing and Analysis by Plaintext Randomization
1 Introduction
1.1 Plaintext Randomization
1.2 Our Contributions
2 Cryptographic Security and Games
2.1 Multi-user CCA Security
3 Plaintext Randomization
4 Hybrid Encryption
5 Secret Sharing with Encrypted Shares
6 Conclusions
References
Encryption
Round-Efficient Private Stable Matching from Additive Homomorphic Encryption
1 Introduction
1.1 Related Work
1.2 Contribution
2 Preliminaries
3 Private Stable Matching
3.1 Gale--Shapley Algorithm
3.2 Golle and Franklin--Gondree--Mohassel Private Stable Matching
4 Main Proposal
4.1 New Bid Design
4.2 New Private Stable Matching
4.3 Complexity Analysis
5 Experimental Implementation
5.1 Implemented Version of Our Protocol
5.2 Experimental Settings
5.3 Experimental Results
A Initialization of the Proposed Protocol
B Correctness of the Proposed Protocol
C Security of the Proposed Protocol
References
Efficient and Fully Secure Forward Secure Ciphertext-Policy Attribute-Based Encryption
1 Introduction
2 Preliminaries
2.1 Composite Order Bilinear Maps and Assumptions
2.2 Access Structures and Linear Secret Sharing Schemes
3 Fully Secure Forward Secure Ciphertext-Policy Attribute-Based Encryption
3.1 The Model of FS-CP-ABE
3.2 Security Model for FS-CP-ABE
4 Ciphertext-Policy Attribute-Based Encryption with Augmented Hierarchy (CP-ABE-AH)
4.1 The Model of CP-ABE-AH
4.2 Security Model for CP-ABE-AH
4.3 CP-ABE-AH: Construction
5 Construction of FS-CP-ABE from CP-ABE-AH
6 Efficiency
References
Reducing Public Key Sizes in Bounded CCA-Secure KEMs with Optimal Ciphertext Length
1 Introduction
1.1 Background
1.2 Our Contribution
1.3 Related Works
2 Preliminaries
2.1 Notation
2.2 Syntax and Security Notions
2.3 Number Theoretic Assumptions
2.4 Cover Free Family and Its Two-Dimensional Representation
3 Construction from the CBDH Assumption
3.1 Construction
3.2 Security
4 Construction from the Factoring Assumption
4.1 CDH Assumption on QRN and BBS Pseudo-Random Number Generator
4.2 Construction
4.3 Security
References
Malware and Critical Infrastructures
4GMOP: Mopping Malware Initiated SMS Traffic in Mobile Networks
1 Introduction
2 Mobile Malware Traffic
2.1 Traffic During Infection
2.2 Traffic During Execution
3 The 4GMOP Sensor
3.1 Architecture Overview
3.2 Sensor Placement
4 The SMS-Mv1.0 Corpus
4.1 SMS Usage in Mobile Malware Samples
4.2 Building the SMS-Mv1.0 Corpus
5 An Example Classifier
5.1 Feature Selection
5.2 Evaluation
6 Conclusion
References
Design and Analysis of a Sophisticated Malware Attack Against Smart Grid
1 Introduction
2 Smart Grid Architecture
3 Smart Grid Blackout Attack
3.1 Phase 1: Initial Penetration
3.2 Phase 2: Espionage
3.3 Phase 3: Development of Malware for the Deceptive Attack
3.4 Phase 4: Deceptive Attack
3.5 Phase 5: Cleanup and Aftermath
4 Concluding Remarks
References
Multi-round Attacks on Structural Controllability Properties for Non-complete Random Graphs
1 Introduction
2 Multi-round Threat Model
3 Attack Scenarios on Structural Controllability
3.1 SCN-1 and SCN-2: Exploitation of Links and Vertices in Graphs
3.2 SCN3: Exploitation of Links and Vertices in Power-Law Subgraphs
4 Conclusions
References
Cryptanalysis
Improved Meet-in-the-Middle Attacks on Round-Reduced ARIA
1 Introduction
2 Preliminary
2.1 A Short Description of ARIA
2.2 Notations
3 New 4-Round Meet-in-the-Middle Distinguisher of ARIA
4 Meet-in-the-Middle Attacks on Round-Reduced ARIA
4.1 7-Round Attack on ARIA-192/256
4.2 Extension to 8-Round Attack on ARIA-256
4.3 Attack on 7-Round ARIA-128
4.4 9-Round Attack on ARIA-256
5 Conclusion
References
Establishing Equations: The Complexity of Algebraic and Fast Algebraic Attacks Revisited
1 Introduction
2 Preliminaries
3 Algebraic Attacks
3.1 Simple Method: Polynomial Multiplication
3.2 Improved Method: Shift and Update from the Feedback Polynomial
3.3 New Method: Frobenius Form of the Monomial State Rewriting Matrix
4 Fast Algebraic Attacks
4.1 Simple Method: Polynomial Multiplication
4.2 Improved Method: Shift and Update from the Feedback Polynomial
4.3 New Method: Frobenius Form of the Monomial State Rewriting Matrix
5 General Algebraic and Fast Algebraic Attacks
5.1 Simple Method: Polynomial Multiplication
5.2 Improved Method: Shift and Update from the Feedback Polynomial
5.3 New Method: Frobenius Form of the Monomial State Rewriting Matrix
6 Conclusion
References
Factoring a Multiprime Modulus N with Random Bits
1 Introduction
2 Algorithm to Factor a Multiprime Modulus N
3 Behavior and Complexity of the Algorithm to Factor N
3.1 Number of Incorrect Roots Lifted from a Good Root (G)
3.2 Number of Incorrect Roots Lifted from an Incorrect Root (B)
3.3 Number of Incorrect Roots Lifted at Level j (Xj)
3.4 Complexity of the Algorithm to Factor
4 Implementation and Performance
5 Concluding Remarks
References
Block Ciphers and Stream Ciphers
Faster 128-EEA3 and 128-EIA3 Software
1 Preliminaries
2 Software Optimizations
3 Results
3.1 Hexagon Architecture
3.2 Performance
4 Conclusion
References
Merging the Camellia, SMS4 and AES S-Boxes in a Single S-Box with Composite Bases
1 Introduction
2 Notation and Mathematical Representations
3 Mathematical Representation of the Camellia, AES and SMS4 S-Boxes
3.1 Merging the Camellia, AES and SMS4 S-Boxes by Using Composite Fields
4 Results and Comparisons
5 Conclusions
References
Entity Authentication
Offline Dictionary Attack on Password Authentication Schemes Using Smart Cards
1 Introduction
2 System Architecture and Adversary Models
2.1 System Architecture of Two-Factor Authentication
2.2 Adversary Models for Smart-card-based Authentication and for Common-memory-based Authentication
3 Cryptanalysis of Hsieh-Leu's Scheme
3.1 A Brief Review of Hsieh-Leu's Scheme
3.2 Offline Dictionary Attack
4 Cryptanalysis of PSCAV from SEC 2012
4.1 A Brief Review of PSCAV
4.2 Offline Dictionary Attack
5 Conclusion
References
Self-blindable Credential: Towards Anonymous Entity Authentication Upon Resource Constrained Devices
1 Introduction
2 Modeling of Self-blindable Credential
3 Self-blindable Credential with Verifier-Local Revocation
3.1 Design Rationale
3.2 Construction Details
3.3 Security Analysis
4 Self-blindable Credential with Forward Unlinkability and Scalable Revocation
4.1 Forward Unlinkable Self-blindable Credential
4.2 Scalable Revocation
References
Practical and Provably Secure Distance-Bounding
1 Introduction
2 Model for Distance-Bounding Protocols
3 Practical and Secure Distance-Bounding Protocols
References
Usability and Risk Perception
On the Viability of CAPTCHAs for use in Telephony Systems: A Usability Field Study
1 Introduction
2 Related Work
3 Hypotheses
4 Studied Audio CAPTCHAs
5 Usability Evaluation
6 Study Results
6.1 Captcha Inconvenience
6.2 Hypotheses Validation
7 Discussion
8 Guidelines
References
Cars, Condoms, and Facebook
1 Introduction
2 Background and Related Work
3 Methodology
4 Results
5 Discussion
6 Conclusion and Future Work
References
Access Control
Achieving Revocable Fine-Grained Cryptographic Access Control over Cloud Data
1 Introduction
2 Synopsis
2.1 System Setting
2.2 Fine-Grained Access Control
2.3 Our Approach
3 A Concrete Instantiation
3.1 Construction Details
3.2 Security Analysis
4 Experimental Results
4.1 Experimental Results
5 Related Work
6 Conclusions
A Formulation of Security Notions
B Security Proof for Theorem??
References
Fine-Grained Access Control for HTML5-Based Mobile Applications in Android
1 Introduction
2 The Problem
2.1 Security Problems
2.2 Our Approach
3 Design
3.1 Access Control Model
3.2 Policy Configuration
3.3 Assigning Effective Permission to Frame
3.4 Setting Effective Permission at Invocation
3.5 Checking Effective Permissions
4 Evaluation
4.1 Restrict Permissions of Untrusted Frames
4.2 Performance Evaluation
5 Related Work
6 Summary
References
Computer Security
CrowdFlow: Efficient Information Flow Security
1 Motivation
2 Background on JS Security
3 Threat Model
4 CrowdFlow
4.1 Probabilistic Tracking
4.2 Tracking Multiple Domains
4.3 Reporting Information Flows
5 Implementation
5.1 Partial Taint Tracking Interpreter
5.2 Information Flow Tracking Interpreter
5.3 Switching Interpreters
5.4 Multi-domain Label Encoding
6 Evaluation
6.1 Security (Effectiveness)
6.2 Performance (Efficiency)
6.3 Discussion and Limitations
7 Related Work
8 Conclusion
A Detailed Benchmark Results
References
Privacy Attacks
DroidTest: Testing Android Applications for Leakage of Private Information
1 Introduction
2 Related Work
3 Background and Assumptions
3.1 Android Permission Scheme
3.2 Sensitive Information Source and Sink
3.3 Adversary Model
4 DroidTest Overview
5 Implementation
5.1 Test Environment Setup
5.2 Test Case Generator
5.3 Test Case Executor
5.4 Kernel Log Collector
6 Experiment and Results
6.1 Scope of Sensitive Information Source and Sink
6.2 Datasets
6.3 Results
6.4 Discussions and Findings
7 Conclusion
References
A Dangerous Mix: Large-Scale Analysis of Mixed-Content Websites
1 Introduction
2 Problem Statement
3 Impact of Mixed Content Attacks
4 Data Collection
4.1 Crawling Experiment
4.2 Data Collection Results
5 Discussion
5.1 Websites Having Mixed Content
5.2 Providers of Mixed-Content Files
6 Mixed Content Mitigation Techniques
6.1 Browser Vendors
6.2 Website Owners
6.3 Resource Providers
7 Related Work
8 Conclusion
References
Cryptography
An Ordered Multisignature Scheme Under the CDH Assumption Without Random Oracles
1 Introduction
1.1 Motivation
1.2 Our Contribution
1.3 Related Work
2 Preliminaries
3 Ordered Multisignatures
3.1 The Syntax
3.2 Security Model
3.3 Technical Problem
4 Proposed Scheme
4.1 Our Strategy
4.2 The Construction
4.3 Security Analysis
References
Human Assisted Randomness Generation Using Video Games
1 Introduction
1.1 Our Work
1.2 Applications
2 Preliminaries
2.1 True Random Number Generators (TRNG)
3 Randomness from User Errors
3.1 The Game
3.2 Entropy Source
3.3 From the Entropy Source to the Output
3.4 Game Parameters and Levels
4 Experimental Setup and Results
4.1 Entropy per Round
4.2 Effect of Players' Experience on Min-entropy
4.3 Min-entropy and Game Levels
4.4 Randomness Required by Computer
5 Concluding Remarks
References
Security Ranking Among Assumptions Within the Uber Assumption Framework
1 Introduction
2 Security Assumptions
3 From Polynomials to Powers
3.1 Using a Perfect Oracle
3.2 Using an Adversarial Oracle
4 From Powers to N-product
5 From N-product to Polynomials
6 The Bilinear Setting
References
A Secure and Efficient Method for Scalar Multiplication on Supersingular Elliptic Curves over Binary Fields
1 Introduction
2 Previous Work
3 Multiplication Method: Montgomery's Ladder
4 Group Law
5 Improved Scalar Multiplication
6 Using Projective Coordinates
7 Comparison with Double-and-Add
8 Comparison with Methods NAF and w-NAF
9 Further Improvements
10 Concluding Remarks
A Appendix: Montgomery's Ladder Invariant
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken