Cryptology and Network Security

Name: Cryptology and Network Security | 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings

Sara Foresti Giuseppe Persiano(Editor)

Springer (Publisher)

Published on 30. October 2016

XVI, 762 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-48965-0 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Contents
Cryptanalysis of Symmetric Key
Linear Regression Attack with F-test: A New SCARE Technique for Secret Block Ciphers
1 Introduction
2 Preliminaries
2.1 Previous SCARE Techniques
2.2 Linear Regression Attack
3 LRA with F-test: A Useful Tool
3.1 Motivation
3.2 F-test with Nested Model
3.3 Applications in SCARE
4 A Realistic LRA-Based SCARE
4.1 Generalized Structure of the Target Cipher
4.2 Preparation
4.3 Step 1: Recovering P0
4.4 Step 2: Recovering S1
4.5 Step 3: Recovering P1
4.6 The Complete Attack
5 Discussion
6 Conclusion
References
Compact Representation for Division Property
1 Introduction
2 Preliminaries
2.1 Notations
2.2 Integral Attack
2.3 Division Property
2.4 Bit-Based Division Property
3 Compact Representation for Division Property
3.1 Motivation
3.2 General Idea
3.3 Toy Cipher Using PRESENT S-box
3.4 Core Function of PRESENT
4 Improved Integral Attack on PRESENT
4.1 New Algorithm to Find Integral Characteristics
4.2 Key Recovery with MTTS Technique and FFT Key Recovery
5 Conclusion
References
An Automatic Cryptanalysis of Transposition Ciphers Using Compression
1 Introduction
2 Previous Work
3 Compression as a Cryptanalysis Method
3.1 PPM Compression Code Length Metric
3.2 Calculating Codelengths Using the Gzip Compression Method
4 Transposition Ciphers
5 Our Method
6 Experimental Results
7 Conclusions
References
SideChannel Attacks and Implementation
Side-Channel Attacks on Threshold Implementations Using a Glitch Algebra
1 Introduction
2 The Theory
2.1 The Glitch Algebra
2.2 Side-Channel Attack with Noise
3 Implementation with n=2
4 Implementation with n=3
4.1 Power Analysis not Based on the Mean Value (All Assumptions)
4.2 Probing Attack with Two Probes Based on the Mean Value (All Assumptions)
4.3 Power Analysis and Probing Attack on Two ANDs Based on the Mean Value (Assumptions (2) or (3))
5 Implementation with n=4
6 Higher-Order Threshold Implementation with n=5
7 Conclusion
References
Diversity Within the Rijndael Design Principles for Resistance to Differential Power Analysis
1 Introduction
1.1 Prior Work
1.2 Our Contributions
1.3 Envisioned Usage
2 The Design of Our Rijndael Variants
2.1 SubBytes
2.2 ShiftRows
2.3 MixColumns
2.4 AddRoundKey
2.5 Total Entropy Provided by Our Variants
3 Implementation Cost
4 Cryptanalytic Attacks
5 Side Channel Attacks
5.1 Side Channel Methods
5.2 Side Channel Results
5.3 SubBytes Discussion
5.4 Template Attack to Discover SubBytes
5.5 ShiftRows Discussion
6 Conclusion
References
NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM
1 Introduction
2 SIDH Protocol
2.1 Key Exchange Protocol Based on Isogenies
2.2 Protocol Optimizations
3 Proposed Choice of SIDH-Friendly Primes
3.1 Proposed Prime Search
4 Proposed Finite-Field Arithmetic
4.1 Field Addition
4.2 Field Multiplication and Squaring
4.3 Field Inversion
5 Affine or Projective Isogenies
6 Implementation Results and Discussion
6.1 ARM Architectures
6.2 Testing Methodology
6.3 Results and Comparison
7 Conclusion
References
Lattice-Based Cryptography
Server-Aided Revocable Identity-Based Encryption from Lattices
1 Introduction
2 Background and Definitions
2.1 Server-Aided Revocable Identity-Based Encryption
2.2 Background on Lattices
2.3 The LWE Problem and Its Hardness Assumption
2.4 The Agrawal-Boneh-Boyen (H)IBE Scheme
2.5 Chen et al.'s RIBE Scheme
3 Our Lattice-Based SR-IBE Scheme
4 Analysis
5 Conclusion and Open Problems
References
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
1 Introduction
2 Preliminaries
2.1 The Ring Learning with Errors (R-LWE) Setting
2.2 The Number Theoretic Transform (NTT)
3 Modular Reduction and Speeding up the NTT
4 Case Study: R-LWE Key Exchange
5 Implementation Results
5.1 Performance Benchmarks
6 Conclusion
References
An Efficient Lattice-Based Multisignature Scheme with Applications to Bitcoins
1 Introduction
2 Preliminaries
2.1 Notation
3 Multisignature Scheme
3.1 Our Construction
3.2 Security
3.3 Application Scenario: Signed Bitcoin Transactions
4 Fast Polynomial Arithmetic
4.1 Polynomial Multiplication
4.2 Optimizations
5 Performance Analysis and Benchmarks
5.1 Experimental Results of Our Multisignature Scheme
References
Virtual Private Network
Breaking PPTP VPNs via RADIUS Encryption
1 Introduction
2 Foundations
2.1 PPTP
2.2 MS-CHAPv2
2.3 RADIUS Encryption
2.4 MPPE
3 Attack
3.1 Scenario
3.2 Known-Plaintext Attack on RADIUS Encryption
3.3 Chosen-Ciphertext Attack on PPTP
3.4 Practical Evaluation
4 Conclusion
References
LEAP: A Next-Generation Client VPN and Encrypted Email Provider
1 Introduction
2 Goals and Requirements
2.1 Goal
2.2 Threat Model
2.3 Requirements
2.4 General Design
3 The LEAP Architecture
3.1 LEAP Platform
3.2 Soledad
3.3 LEAP Client
3.4 Nicknym Key Management
4 Current State and Future Work
References
Implementation State of HSTS and HPKP in Both Browsers and Servers
1 Introduction
2 Background
2.1 Related Work
3 HSTS Specifications
4 HPKP Specifications
4.1 General Security Considerations
5 Implementation at Web Server Level
6 Study and Analysis of Implementation Weaknesses
6.1 Orphaned Domains
6.2 Implementation of Protocols in Firefox
6.3 Implementation of Protocols in Chrome
6.4 Implementation of Protocols in Internet Explorer (and Edge)
7 Conclusions
References
Signatures and Hash
Signer-Anonymous Designated-Verifier Redactable Signatures for Cloud-Based Data Sharing
1 Introduction
2 Preliminaries
3 Security Model
4 A Generic Construction
5 Boosting Efficiency via Key-Homomorphisms
6 Conclusion
References
Group Signature with Deniability: How to Disavow a Signature
1 Introduction
2 Preliminaries
3 Deniable Group Signatures
3.1 Modification to the BSZ Model
3.2 Formal Definition
4 The Proposed Deniable Group Signature Scheme
4.1 Generic Construction and Its Limitation
4.2 The Proposed Scheme
5 Security Analysis
References
Sandwich Construction for Keyed Sponges: Independence Between Capacity and Online Queries
1 Introduction
2 Preliminaries
3 Sandwich Keyed Sponge and the Security
3.1 The Construction of Sandwich Keyed Sponge
3.2 The PRF-Security of Sandwich Keyed Sponge
4 Proof of Theorem 1
4.1 Upper Bound of Pr[DG1 1] - Pr[DG2 1]
4.2 Upper Bound of Pr[DG2 1] - Pr[DG3 1]
4.3 Upper Bound of the Advantage
References
MultiParty Computation
Secure Error-Tolerant Graph Matching Protocols
1 Introduction
2 Related Work
3 Preliminaries
4 Problem Formulation
5 Description of Proposed GED Protocols
5.1 A Framework for Two-Party GED Computation
5.2 Sub-protocols
5.3 The Main Protocol for Graph Edit Distance
6 Conclusions
A Description of Sub-protocols
A.1 Encrypted Equality Test Protocol and Comparison Protocol
A.2 Substitution Cost Protocol
B Graph Edit Operations and Cost Matrix
References
Efficient Verifiable Computation of XOR for Biometric Authentication
1 Introduction
2 Preliminaries
3 Adversary Model
4 The Scheme and the Protocol
5 Protocol Extensions
6 Conclusions
References
Verifiable Message-Locked Encryption
1 Introduction
2 Preliminaries
2.1 Bilinear Groups
2.2 Computational Assumptions
2.3 Commitment Schemes
2.4 Non-Interactive Zero-Knowledge (NIZK) Proofs
2.5 Hashing Block Sources
3 Message-Locked Encryption: Definition and Security
3.1 Syntactic Definition
3.2 Privacy
3.3 Tag Consistency
4 Deduplication Consistency
4.1 Overview
4.2 Formal Definition
4.3 A Generic Construction
5 A Concrete Message Locked Encryption with Deduplication Consistency
6 Security and Efficiency Arguments
6.1 Privacy
6.2 Tag Consistency and Deduplication Consistency
6.3 Efficiency
References
Symmetric Cryptography and Authentication
Security of Online AE Schemes in RUP Setting
1 Introduction
2 Preliminaries
2.1 Authenticated Encryption (AE) Scheme
2.2 Security Definitions Under RUP Environment
3 New Security Notion and Relations
4 Security Analysis of Existing Schemes
5 Security of Verification
6 Conclusion
References
An Efficient Entity Authentication Protocol with Enhanced Security and Privacy Properties
1 Introduction
2 Background and Threat Model
2.1 Security and Privacy Definitions
2.2 Key Derivation Function
2.3 Private Information Retrieval
2.4 Threat Model
3 The Protocol
3.1 KDF
3.2 PIR
4 Security and Privacy Analysis
5 Conclusions
References
Probabilistic Generation of Trapdoors: Reducing Information Leakage of Searchable Symmetric Encryption
1 Introduction
1.1 Background
1.2 Motivations
1.3 Key Technique: Trapdoor Locked Encryption Technique
1.4 Our Contributions
1.5 Related Works
2 Preliminaries
3 Definitions
3.1 Syntax
3.2 Security
4 Specific Construction
4.1 A Construction of Our Scheme
4.2 Security
5 Conclusion
References
System Security
AAL and Static Conflict Detection in Policy
1 Introduction
2 Related Work
3 Usage Control Policies in AAL
3.1 Security and Privacy Concepts
3.2 Advanced Concepts
3.3 Comparisons with XACML
4 Existing Conflict Detection Mechanisms
4.1 Dynamic Detection
4.2 Testing
4.3 Static Detection
5 Conflict Detection in AAL
5.1 Examples
5.2 Performance Tests
6 Conclusion
References
Component-Oriented Access Control for Deployment of Application Services in Containerized Environments
1 Introduction
2 Communicative Access Control
3 Communications Architecture
3.1 IPC Constraints
3.2 Tuple Space Paradigm
3.3 Tuple Space Transactions
3.4 Security Aspects
4 Experimental Results
5 Related Work
6 Conclusion and Future Work
References
Generic Access Control System for Ad Hoc MCC and Fog Computing
1 Introduction
2 Related Works
2.1 Related Works on Access Control in Fog
2.2 Related Works on Access Control in P2P Systems
3 Previous Work
3.1 The Architecture
3.2 The Protocol
3.3 Results
4 The Proposal
4.1 The Requirements
4.2 The Proposed Mechanisms
4.3 The Protocol:
5 Performance Evaluation
5.1 Simulation Model
5.2 Evaluation of TChord
5.3 Evaluation of TCloudG
5.4 Evaluation of TAccess
5.5 Evaluation of TAdd and TDelete
6 Conclusion and Outlook
References
Functional and Homomorphic Encryption
SecReach: Secure Reachability Computation on Encrypted Location Check-in Data
1 Introduction
2 Problem Statement
2.1 System and Adversarial Model
2.2 Location Check-in Data, Proximity and Reachability
2.3 Design Objectives
3 Preliminaries
3.1 Bloom Filters
3.2 Somewhat Homomorphic Encryption
4 SecReach: Secure Reachability Computation
4.1 Our Main Idea
4.2 The Details of Our Scheme
5 Security Analysis
6 Proof of Concept and Experimental Results
7 Related Work
8 Conclusion and Future Work
References
FHE Over the Integers and Modular Arithmetic Circuits
1 Introduction
2 Preliminaries
2.1 Notation
2.2 Nuida--Kurosawa Fully Homomorphic Encryption Scheme
2.3 More Remarks on NK Scheme
3 Homomorphic Evaluation of mod-Q Arithmetic Circuit Using FHE Scheme with Binary Message Space
3.1 `39`42`"613A``45`47`"603AEvaluateQ and mod-Q Arithmetic Circuits
4 Comparison of Convert-NK2 with NKQ
4.1 Dependence of NKQ Parameters upon Q
4.2 Efficiency of Convert-NK2 Measured Against NKQ
5 Conclusion
References
An Efficient Somewhat Homomorphic Encryption Scheme Based on Factorization
1 Introduction
2 Preliminary Definitions and Results
2.1 Roots of Polynomials
2.2 -symmetry
2.3 Rational Functions
3 A Somewhat Homomorphic Encryption (SWHE)
3.1 A Private-Key Encryption
3.2 The Multiplicative Operator
3.3 The Additive Operator
3.4 Discussion
4 Security Analysis
4.1 Generic Ring Model
4.2 Hardness of Factoring Generic IND-CPA Security
5 Lattice-Based Cryptanalysis
5.1 A Basic Example
5.2 Characterization of Lattice-Based Attacks
5.3 Analysis
6 Efficiency
7 Future Work
References
Information Theoretic Security
Efficient, XOR-Based, Ideal (t,n)-threshold Schemes
1 Introduction
1.1 Contributions
1.2 Organisation
2 Preliminaries
2.1 Secret Sharing Schemes
2.2 Error Correcting Codes
2.3 Information Dispersal Algorithms
3 An Efficient (t,n)-threshold Scheme
3.1 Share
3.2 Recover
4 Security Analysis
4.1 Recoverability
4.2 Privacy
4.3 Information Rate
5 Efficiency Analysis
5.1 Complexity of Share
5.2 Complexity of Recover
6 Comparison to Other Schemes
6.1 Other Schemes
6.2 Discussion
6.3 Conclusion
References
Efficient and Secure Multiparty Computations Using a Standard Deck of Playing Cards
1 Introduction
1.1 Mainstream Card-Based Protocols
1.2 Use of a Standard Deck of Playing Cards
1.3 Our Results
2 Niemi-Renvall Protocols
2.1 Random Cuts and Search for Cards
2.2 And Computation
2.3 XOR Computation
2.4 Secure Copy
3 Our AND Protocol
3.1 Random Bisection Cuts
3.2 Change of Base
3.3 Opaque Commitment Pair
3.4 Description of Our Protocol
4 Our XOR Protocol
5 Our Copy Protocol
6 Conclusion
References
Efficient Card-Based Cryptographic Protocols for Millionaires' Problem Utilizing Private Permutations
1 Introduction
2 Preliminaries
2.1 Notations and Basic Operations
2.2 Random Bisection Cut and Private Permutation
2.3 Security Notion
3 Proposed Protocol I: Card-Based Cryptographic Protocol for Millionaires' Problem Based on Yao's Solution
3.1 Yao's Solution and Our Idea Behind the Proposed Protocol I
3.2 Proposed Protocol I
4 Proposed Protocol II: Card-Based Cryptographic Protocol for Millionaires' Problem with Storage
4.1 Ideas Behind Proposed Protocol II
4.2 Proposed Protocol II
5 Concluding Remarks
References
Malware and Attacks
Evaluation on Malware Classification by Session Sequence of Common Protocols
1 Introduction
2 Related Works
3 Proposed Method
3.1 Overview
3.2 Feature Vector Extraction (Step 1)
3.3 Clustering and Labeling (Step 2)
3.4 Similarity Calculation (Step 3)
3.5 New Malware Judgement (Step 4)
3.6 Classification (Step 5)
4 Evaluation
4.1 Experimental Data
4.2 Results
4.3 Consideration
5 Conclusion and Future Works
References
An Efficient Approach to Detect TorrentLocker Ransomware in Computer Systems
1 Introduction
2 File Differentiation Measures
3 Related Work
4 The Proposed Approach to Detect TorrentLocker
4.1 Shannon Entropy to Distinguish Files
4.2 Kullback-Liebler Divergence to Distinguish Files
5 Evaluation
5.1 Choosing KBL Threshold Based on the Accuracy Rate
5.2 Improving Effectiveness by Calculating KBL Values for First Kilobytes
6 Conclusions
References
Detecting Malware Through Anti-analysis Signals - A Preliminary Study
1 Introduction
1.1 Related Works
2 Detecting Anti-analysis Techniques
3 Implementation
4 Experiments
5 Discussion
6 Conclusion
References
Attackers in Wireless Sensor Networks Will Be Neither Random Nor Jumping -- Secrecy Amplification Case
1 Introduction
2 Related Work
3 Parameterized Attacker
4 Experimental Results
5 Conclusions
References
Improved Attacks on Extended Generalized Feistel Networks
1 Introduction
2 Notations - Overview of the Attacks
2.1 Notation
2.2 Overview of the Attacks
3 Expectations and Standard Deviation for KPA on Random Permutations
4 Extended Generalized Feistel Networks
4.1 Description
4.2 Generic Attacks on EGFN with 8 Branches
4.3 Simulations
4.4 Summary of the Results
5 Conclusion
References
When Constant-Time Source Yields Variable-Time Binary: Exploiting Curve25519-donna Built with MSVC 2015
1 Introduction
2 State of the Art
3 Curve25519
3.1 Curve25519-donna
4 Attack
4.1 Environment
4.2 Timing Leakage Observation
4.3 Timing Leakage Origin
4.4 Timing Attack
5 Results
5.1 Evaluation of the Attack
5.2 Extension to Remote Attacks
6 Conclusion
References
MultiParty Computation and Functional Encryption
On the Power of Public-key Function-Private Functional Encryption
1 Introduction
References
A New Technique for Compacting Secret Key in Attribute-Based Broadcast Encryption
1 Introduction
2 Preliminaries
2.1 Practical Scenario
2.2 Ciphertext-Policy Attribute-Based Broadcast Encryption
2.3 Access Structures
2.4 Bilinear Maps and (P,Q,f)-GDDHE Assumptions
3 Construction
3.1 Intuition Behind Our Construction
3.2 Our Scheme
4 Security
5 Implementation and Optimization
References
An Efficient Construction of Non-Interactive Secure Multiparty Computation
1 Introduction
2 Preliminaries
3 Proposed Construction
3.1 A Fully Robust NIMPC for HindL
3.2 A Fully Robust NIMPC for HallL
4 Conclusion
References
An MPC-Based Privacy-Preserving Protocol for a Local Electricity Trading Market
1 Introduction
2 Preliminaries
3 Privacy-Preserving Protocol for Electricity Trading
4 Experimentation and Discussion
5 Conclusions
References
Implementation of Verified Set Operation Protocols Based on Bilinear Accumulators
1 Introduction
2 Cryptographic Building Blocks
3 Scenario and Protocol Overview
4 Accumulation Tree Protocols
5 Verified Set Operations
6 Conclusions
References
Multi-core FPGA Implementation of ECC with Homogeneous Co-Z Coordinate Representation
1 Introduction
2 History and Related Work
3 Task Scheduling in the Co-Z Ladder
3.1 4 and 5 Cores: Critical Paths Evaluating (X1, X2, Z)
3.2 How Many Cores Are Required for the Fastest Performance?
4 Implementation and Results
4.1 5-Montgomery-Core System
4.2 12-Montgomery-Core System
4.3 3-Core Vs 5-Core
5 Conclusion and Future Work
References
Network Security, Privacy, and Authentication
DNSSEC Misconfigurations in Popular Domains
1 Introduction
2 Related Work
3 DNSSEC Adoption/Configuration Framework
4 Evaluating Vulnerabilities in DNSSEC Adoption
5 Conclusion
References
Integral Privacy
1 Introduction
2 Notation and Problem Set up
3 Integral Privacy
3.1 Specific Scenario #1
3.2 Intruder's Goal
3.3 Privacy Problem
3.4 Integral Privacy Definitions
3.5 Other Specific Scenarios
4 Integral Privacy and Differential Privacy
5 Conclusions
References
Sharing Is Caring, or Callous?
1 Introduction
2 Related Work
3 Development of Research Question
4 Method
5 Data Description
6 Results
6.1 Model 1
6.2 Model 2
7 Discussion
8 Conclusions
References
Improving the Sphinx Mix Network
1 Introduction
1.1 Related Work on Authenticated Encryption
2 Sphinx Mix Format
3 Authenticated Encryption
4 Solution 1: Sponge
5 Solution 2: Tweakable Blockcipher Based
6 Improving the Sphinx
References
User Authentication from Mouse Movement Data Using SVM Classifier
Abstract
1 Introduction
2 Proposed System Description
2.1 Data Acquisition, Processing, and Segmentation
2.2 Feature Extraction and Normalization
2.3 Training and Classification
3 Experimental Results and Discussion
3.1 Results of Classification
3.2 Comparison with Related Works
4 Conclusion
Acknowledgements
References
Distance Bounding Based on PUF
1 Introduction
2 The Kleber et al. Protocol
2.1 Details of the Protocol
2.2 A Terrorist Fraud Attack
2.3 Slight Modifications of the Protocol
3 Distance Fraud Analysis of PufDB
4 Mafia Fraud Analysis of PufDB
5 Terrorist Fraud Analysis of PufDB
6 Conclusion
References
Posters
Denying Your Whereabouts: A Secure and Deniable Scheme for Location-Based Services
1 Introduction
2 Deniable-LBS Scheme
3 Analysis and Evaluation
4 Conclusions
References
Range Query Integrity in Cloud Data Streams with Efficient Insertion
1 Introduction
2 Description of the Approach
3 Conclusion
References
Vulnerability Analysis Using Google and Shodan
1 Introduction
2 Related Work
3 Classical Search Engines
4 Subject-Specific Search Engines
5 Conclusion
References
Language-Based Hypervisors
1 Introduction
2 Background and Related Work
3 Design and Approach
3.1 Design Details
4 Summary and Future Work
References
Internet Censorship in Italy: A First Look at 3G/4G Networks
1 Introduction
2 UBICA
3 Methodology
4 Preliminary Results
References
A Privacy-Preserving Model for Biometric Fusion
1 Introduction
2 Environment and Settings
3 System Outline
4 Usability and Limitations
5 Conclusion and Discussion
References
Hybrid WBC: Secure and Efficient White-Box Encryption Schemes
1 Introduction
2 Practical Requirements and Design Strategy
2.1 Security Requirements -- A New Threat Model
2.2 Performance and Cost Requirements
2.3 Design Strategies
3 The New Primitives
3.1 General Structure and Security Goals
3.2 The New Hybrid White-Box Schemes
References
Moving in Next Door: Network Flooding as a Side Channel in Cloud Environments
1 Introduction
2 Environments
3 Load Measurement
4 Profiling
5 Counter-Measures and Future Vision
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Cryptology and Network Security

Description

More details

Other editions

Additional editions

Content

System requirements