Information Security and Cryptology

Name: Information Security and Cryptology | 13th International Conference, Inscrypt 2017, Xi'an, China, November 3-5, 2017, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

13th International Conference, Inscrypt 2017, Xi'an, China, November 3-5, 2017, Revised Selected Papers

Xiaofeng Chen Dongdai Lin Moti Yung(Herausgeber*in)

Springer (Verlag)

Erschienen am 12. Februar 2018

XXI, 530 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-75160-3 (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
Inscrypt 2017 13th International Conference on Information Security and Cryptology Xi'an, China November 3-5, 2017
Keynote Speeches
AI-Driven Cyber Security
Generic and Efficient Lattice-Based Key Exchange from Key Consensus with Noise
Contents
Keynote Speeches
Security and Privacy in the IoT
1 Introduction
2 Security Risks for IoT
3 Application Domains
4 Roadmap
4.1 Access Control
4.2 Software and Firmware Security
4.3 Intrusion Detection Systems
5 Concluding Remarks
References
On Crossroads of Privacy Protection
1 Legal Trends
2 Mechanisms
2.1 Anonymous Credentials
2.2 Pseudonymous Identity
2.3 Pseudonymous Authentication and Pseudonymous Signatures
3 Privacy-by-Design and E2E Systems
3.1 Black-Box Devices
3.2 Subversion and Watchdog Concepts
3.3 (Un)trusted Parties and Under-Specification
4 Challenges
4.1 Unification
4.2 Legal Traps
4.3 Lifecycle Issues
4.4 Limitations of Cryptographic Protection
4.5 Transparency
4.6 Formal Security Proofs
References
The Dual Role of Smartphones in IoT Security
1 Introduction
2 Side-Channel Attacks Against 3D Printers
3 Defending Against Voice Impersonation Attacks
4 Conclusion
References
Cryptographic Protocols and Algorithms
Implementing Indistinguishability Obfuscation Using GGH15
1 Introduction
2 Preliminaries
2.1 (Matrix) Branching Program
2.2 Indistinguishability Obfuscation
2.3 GGH15 Multilinear Maps
3 Implementation
3.1 The Framework of Obfuscation
3.2 Implementation Process
3.3 Correctness
3.4 Analysis
4 Improvements
4.1 Fix the Parameter L
4.2 Reduce the Size of Encoded Matrixes
4.3 Comparison
5 Conclusion
References
From Attack on Feige-Shamir to Construction of Oblivious Transfer
1 Introduction
1.1 Our Results
1.2 Related Work
1.3 Organization
2 Preliminaries
2.1 Basic Notations
2.2 The Relations
2.3 Interactive Arguments
2.4 Oblivious Transfer
3 Overview of Deng's Approach to PKE Under OWF
4 (Decisional) Hard Distributions over OR-Relation
5 Main Tool: Distributional Witness Encryption
5.1 Construction of DWE from Injective One Way Functions
6 Oblivious Transfer
6.1 Construction of Semi-honest Oblivious Transfer
6.2 Construction of OT Against Malicious Receiver
References
A New Lattice Sieving Algorithm Base on Angular Locality-Sensitive Hashing
1 Introduction
1.1 Related Work
1.2 Contributions
1.3 Roadmap
2 Locality-Sensitive Hashing
2.1 Locality-Sensitive Hash Families
2.2 Amplification
2.3 Finding nearest neighbors
2.4 Angular Hashing
3 From the Filtered Triple Sieving to the FT-HashSieve
3.1 The Filtered Triple Sieving
3.2 The FT-HashSieve Algorithm
3.3 Heuristically Solving SVP in Time and Space 20.4098n + O(n)
3.4 Heuristically Solving SVP in Time 20.4098406n + o(n) and Space 20.1887n + o(n)
4 Experiment Results
5 FT-HashSieve for the Closest Vector Problem
6 Future Work
References
A Simpler Bitcoin Voting Protocol
1 Introduction
1.1 Related Works
1.2 Contributions
2 Preliminaries
2.1 Overview of Bitcoin
2.2 BIP 65 Proposal
3 Bitcoin Voting Protocol Review
3.1 Vote Commitment Protocol Review
3.2 Vote Casting Protocol Review
4 General Bitcoin Voting Protocol
4.1 Flexible Vote Commitment Protocol
4.2 Simpler Vote Casting Protocol
4.3 Protocol Analysis
5 Conclusion
References
Post-Quantum Secure Remote Password Protocol from RLWE Problem
1 Introduction
1.1 Key Exchange
1.2 Post-Quantum World
1.3 Related Works
1.4 Our Contributions
2 Preliminaries
2.1 Ring Learning with Errors
2.2 Revisit DING12 RLWE Key Exchange Protocol
3 Post-Quantum Secure Remote Password Protocol
3.1 Protocol Construction
3.2 Correctness
3.3 Security of RLWE-SRP
4 Instantiation, Implementation and Performance
4.1 Parameter Choice and Security Level Estimation
4.2 Implementation, Performance and Comparison
5 Conclusions
References
Hashing into Twisted Jacobi Intersection Curves
1 Introduction
2 Twisted Jacobi Intersection Curves
3 Brief SWU Encoding
3.1 Algorithm
3.2 Theoretical Analysis of Time Cost
3.3 B-well-distributed Property of Brief SWU Encoding
3.4 Calculating the Density of the Image
4 Cube Root Encoding
4.1 Algorithm
4.2 Theoretical Analysis of Time Cost
4.3 Properties of Cube Root Encodings
4.4 The Genus of Curve C
4.5 Estimating Character Sums on the Curve
4.6 Galois Group of Field Extension
4.7 Calculating the Density
5 Construction of Hash Function Indifferentiable from Random Oracle
5.1 First Construction
5.2 Second Construction
6 Time Comparison
7 Conclusion
References
Digital Signatures
Identity-Based Key-Insulated Aggregate Signatures, Revisited
1 Introduction
1.1 Background and Motivation
1.2 Contribution
1.3 Related Work
2 Preliminaries
2.1 Notation and Security Assumption
2.2 Security Notions of Key-Insulated Signatures
3 Identity-Based Key-Insulated Aggregate Signatures
3.1 Syntax
3.2 Security Model
4 Proposed Scheme
5 Security
References
A New Constant-Size Accountable Ring Signature Scheme Without Random Oracles
1 Introduction
2 Accountable Ring Signature Scheme
2.1 Syntax
2.2 Security Model
3 Preliminaries
3.1 Indistinguishability Obfuscation
3.2 Puncturable Pseudorandom Functions
3.3 IND-CPA Secure Public Key Encryption Scheme
3.4 One-Way Function
3.5 Pseudorandom Generator
3.6 Collision Resistant Hash Function
4 A New Accountable Ring Signature Scheme
5 Proof of Security
6 Conclusion
References
A Universal Designated Multi-Verifier Transitive Signature Scheme
1 Introduction
1.1 Related Work
1.2 Our Contributions
1.3 Organization
2 Preliminaries
2.1 Notations
2.2 Graphs
2.3 Admissible Bilinear Mapping
2.4 Complexity Problems
3 Description of Universal Designated Multi-Verifier Transitive Signature
3.1 Outline of UDMVTS
3.2 Completeness
3.3 Security Notions
4 Our Proposed UDMVTS Scheme
4.1 Our Concrete Scheme
4.2 Completeness
4.3 Security Analysis
4.4 Performance Analysis
5 Conclusions
References
Cryptanalysis and Improvement of a Strongly Unforgeable Identity-Based Signature Scheme
1 Introduction
2 Preliminaries
2.1 Bilinear Pairings
2.2 Complexity Assumption
3 Revisiting the Tsai et al.'s IBS Scheme
3.1 The Original IBS Scheme
3.2 The Security Proof
4 Cryptanalysis of Tsai et al.'s IBS Scheme
4.1 Attack Against Tsai et al.'s IBS Scheme
4.2 Analysis of Tsai et al.'s Security Proof
5 Improved Strongly Unforgeable IBS Scheme
5.1 Construction
5.2 Proof of Security
5.3 Comparison
6 Conclusion
References
Encryption
Parallel Long Messages Encryption Scheme Based on Certificateless Cryptosystem for Big Data
1 Introduction
2 Relate Works
2.1 Certificateless Public Key Cryptosystem
2.2 Parallel Encryption
3 Parallel Long Messages Encryption Scheme Based on Certificateless Cryptosystem
4 Experiment
5 Security Analysis
6 Conclusion
References
Constant Decryption-Cost Non-monotonic Ciphertext Policy Attribute-Based Encryption with Reduced Secret Key Size (and Dynamic Attributes)
1 Introduction
1.1 Dynamic Settings
1.2 Related Works
1.3 Organization
2 Preliminaries
2.1 Bilinear Maps
2.2 Hardness Assumption
3 Non-monotonic CP-ABE with Short Secret Key
3.1 Syntactic Definition
3.2 Security Definition
3.3 Our Construction
3.4 Security Proof
3.5 Performance Analysis
4 Dynamic Non-monotonic CP-ABE
4.1 Syntactic Definition
4.2 Security Definition
4.3 Our Construction
5 Conclusion and Future Work
References
Fully Homomorphic Encryption Scheme Based on Public Key Compression and Batch Processing
Abstract
1 Introduction
2 Preliminary Knowledge
2.1 Batch Processing Technology
2.2 Encryption Design Satisfies the Plaintext Tank Structure
2.3 Semantic Security of FHE with Batch Processing
3 The Proposed PKCB-SWHE Scheme
3.1 The Public Key Parametric Quadratic with Correction
3.2 The DGHV SWHE Scheme with Batch Processing
3.3 The Proposed PKCB-SWHE Scheme
4 The Proposed PKCB-FHE Scheme
4.1 Squash Decryption Circuit for Batch Processing
4.2 Design of PKCB-FHE Scheme
4.3 The Whole PKCB-FHE Scheme
4.4 Parameter Restriction
5 Security Proof of the Proposed Scheme
5.1 Correctness of the PKCB-SWHE Scheme
5.2 Semantic Security Proof of the PKCB-FHE Scheme
6 Performance Analysis
6.1 The Length of Subset Public Key and the Storage Space
6.2 The Length of the Public Key
6.3 Processing Time
7 Conclusions
Acknowledgements
References
Leveled FHE with Matrix Message Space
1 Introduction
1.1 Related Work
1.2 Our Results
1.3 Our Techniques
1.4 Organization
2 Preliminaries
2.1 The Learning with Errors (LWE) Problem
2.2 Homomorphic Encryption and Bootstrapping
3 Construction of (Leveled) Matrix FHE
3.1 Matrix Variant of Regev's Encryption Scheme
3.2 Matrix Variant of Key Switching
3.3 Leveled FHE with Matrix Message Space
4 Homomorphic Properties and Security
4.1 Homomorphic Properties
4.2 Security
5 Viewed as Packed FHE
A Proof of Theorem 3
References
Predicate Fully Homomorphic Encryption: Achieving Fine-Grained Access Control over Manipulable Ciphertext
1 Introduction
1.1 Our Results
1.2 Related Work
2 Preliminaries
2.1 Notations
2.2 Predicate Key Encapsulation Mechanism
2.3 Multi-key Fully Homomorphic Encryption
2.4 Randomness Extractor and Pseudorandom Generator
3 Predicate Fully Homomorphic Encryption
3.1 Definition
3.2 Security of PFHE
4 Our Construction
4.1 The Transfer Map
4.2 Our Scheme
4.3 Security Analysis, PFHE with Chosen Ciphertext Security
5 CCA1-secure PFHE from Various Way
5.1 Related Definitions
5.2 Conversion from CPA-secure MPFHE
5.3 Security Analysis for the Conversion
6 Conclusion
References
Cryptanalysis and Attack
NativeSpeaker: Identifying Crypto Misuses in Android Native Code Libraries
1 Introduction
2 Excavating Semantic Information of Native Code Library
2.1 Challenges of Native Code Analysis
2.2 Extracing Semantics in Native Code Library
3 NativeSpeaker
3.1 Preprocessing of Native Library
3.2 Crypto Function Recognition
3.3 Cryptographic Misuse Detection
4 Evaluation
4.1 Dataset
4.2 Native Code Analysis
4.3 Cryptographic Algorithm Recognition
4.4 Cryptographic Misuse Detection
5 Related Work
A Appendix
References
A Game-Based Framework Towards Cyber-Attacks on State Estimation in ICSs
1 Introduction
2 Problem Analysis
2.1 System Model
2.2 State Estimation
2.3 Defender Model
2.4 Attack Model
2.5 Communication Channel
2.6 Main Problem
3 The Game-Based Framework
3.1 The Problem of Commons-Based Framework
3.2 Existence of Nash Equilibrium
4 Update of the Game Theory Action
5 Example and Simulation Analysis
6 Conclusion
References
Cryptanalysis of Acorn in Nonce-Reuse Setting
1 Introduction
2 Brief Descriptions of Acorn v2 and v3
3 The State Recovery Attack on Acorn V2
3.1 Gathering Different States
3.2 Retrieving Linear Equations
3.3 Implementation and Verification
4 The State Recovery Attack on Acorn V3
4.1 Gathering Different States
4.2 Retrieving Linear Equations
4.3 Implementation and Verification
5 Conclusion
A Appendix
References
An Improved Method to Unveil Malware's Hidden Behavior
1 Introduction
2 Background and Related Work
2.1 Problem Statement
2.2 Related Work
3 Pre-selection of Potential Targeted Malware
3.1 Function Call Graph
3.2 Dynamic Information
3.3 Map Dynamic Information on FCG
4 Function Summary Based Symbolic Execution
4.1 Definition of Function Summary
4.2 Computing Summaries
4.3 Automatic Generate Windows API Summary
4.4 Emulate Key Windows API Function
4.5 Static and Dynamic Hook Windows API
5 Evaluation
5.1 Experiment Dataset
5.2 Experiment Setup
5.3 Experiments on General Malware Corpus
5.4 Case Studies
6 Discussion
7 Conclusions
References
BotTokenizer: Exploring Network Tokens of HTTP-Based Botnet Using Malicious Network Traces
1 Introduction
2 Background
2.1 Network Behavioral Signatures
2.2 Network Tokens of HTTP-Based Botnet C&C Traffic
3 System Design and Implementation
4 Experiments
4.1 Experiment Overview
4.2 Dataset
4.3 Performance Metric
5 Experimental Results and Discussions
5.1 Experimental Results
5.2 Comparison with State of the Art
5.3 Discussions
5.4 BotTokenizer Deployment Environment
5.5 Limitations
6 Related Work
7 Conclusion
References
Improved Cryptanalysis of an ISO Standard Lightweight Block Cipher with Refined MILP Modelling
1 Introduction
2 Preliminaries
2.1 Notations
2.2 Description of HIGHT
2.3 Security Analysis Results of HIGHT
3 MILP-Based Automatic Search for Differential and Linear Trails
3.1 Mixed Integer Linear Programming (MILP)
3.2 Differential Constraints for Different Operations
3.3 Linear Constraints for Different Operations
4 The Refined MILP Model and Application to HIGHT
4.1 The Refined MILP Model
4.2 Construct the Refined MILP Model for HIGHT
4.3 Comparison of Constraints and Variables in the MILP Model
5 The Differential and Linear Cryptanalysis for HIGHT
5.1 The Differential Cryptanalysis for HIGHT
5.2 The Linear Cryptanalysis for HIGHT
6 Conclusion
References
Meet in the Middle Attack on Type-1 Feistel Construction
1 Introduction
2 Preliminaries
2.1 Notation and Definition
2.2 Properties
3 Meet in the Middle Attacks on Type-1 Feistel Construction
3.1 3d-1 Rounds Distinguisher of Type-1 Feistel Construction
3.2 5d-3 Rounds Key Recovery Attack of Type-1 Feistel Construction
3.3 Complexity Analysis
4 Conclusion
References
Applications
Influence of Error on Hamming Weights for ASCA
1 Introduction
2 Tolerant Algebraic Side-Channel Analysis
3 Attack Model
3.1 Variables
3.2 Constraints
3.3 Search
4 Experimental Setup
4.1 Subround Comparison
4.2 Error Tolerance
5 Results
6 Conclusions
References
State-of-the-Art: Security Competition in Talent Education
1 Introduction
2 State-of-the-Art: Security Competition
2.1 Introduction of Nine Representative Competitions
2.2 Attribute Analysis of Nine Representative Competitions
2.3 Skill Analysis of Nine Representative Competitions
3 Explore-Exploit: Overview
3.1 Network Scale
3.2 Scoring Mechanism
3.3 Winning Strategy
3.4 Weight Calculation
4 The First Explore-Exploit Competition: Design
4.1 Topology-by-Design
4.2 Vulnerable-by-Design
4.3 Interactive-by-Design
5 The First Explore-Exploit Competition: Review
5.1 Prior Training
5.2 Vulnerability Exploiting: Uploading Web Shells
5.3 Network Exploring: Weak Password Cracking
5.4 Lateral Movement: Pivoting Techniques
5.5 Asset Discovery: Value of Post-penetration
6 The First Explore-Exploit Competition: Result
7 Discussion and Future Work
8 Conclusion
References
A Modified Fuzzy Fingerprint Vault Based on Pair-Polar Minutiae Structures
1 Introduction
1.1 Background
1.2 Previous Works
1.3 Our Contribution
1.4 Organization
2 Our Fuzzy Vault Scheme
2.1 Pair-Polar(P-P) Minutiae Structure Construction
2.2 Minutiae Quantization
2.3 Minutia Descriptor Estimation
2.4 Encoding Stage
2.5 Decoding Stage
3 Experiment Evaluation and Analysis
3.1 Evaluation
3.2 Security Analysis
4 Conclusion
References
NOR: Towards Non-intrusive, Real-Time and OS-agnostic Introspection for Virtual Machines in Cloud Environment
1 Introduction
2 Background
3 Design
3.1 Threat Model and Assumptions
3.2 Enabling Schemes and Techniques
4 Implementation
4.1 Snapshot Polling Triggered by Designated Events Captured from Event-Driven Monitoring
4.2 Flexible Monitoring
5 Evaluation
5.1 Effectiveness Against Kernel Rootkits
5.2 Effectiveness Against Transient Attacks
5.3 Effectiveness on Agnostic OSes
5.4 Impact on Performance Overhead
6 Discussion
7 Related Work
8 Conclusion
References
A Method to Enlarge the Design Distance of BCH Codes and Some Classes of Infinite Optimal Cyclic Codes
1 Introduction
2 Preliminaries
2.1 Linear complexity and minimal polynomial
2.2 The General Generalized Cyclotomy of Order Two Modulo pq and Generalized Cyclotomic Sequence
3 A Class of Optimal Cyclic Codes Derived from Generalized Cyclotomy
4 Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken