Information Security and Privacy

Name: Information Security and Privacy | 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings
Brand: Springer
Price: 96.29 EUR
Availability: OnlineOnly

23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings

Willy Susilo Guomin Yang(Editor)

Springer (Publisher)

Published on 2. July 2018

XV, 833 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-93638-3 (ISBN)

€96.29incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
ACISP 2018
Contents
Foundation
A Deterministic Algorithm for Computing Divisors in an Interval
1 Introduction
1.1 Our Contributions
2 Preliminaries
3 Review Kim-Cheon's Algorithms
4 Our Deterministic Algorithm
4.1 Algorithmic Details
4.2 Logarithmic Speedup
5 Conclusion
References
Reusable Fuzzy Extractor from LWE
1 Introduction
1.1 Our Contribution
2 Preliminaries
2.1 Metric Spaces
2.2 Min-Entropy and Statistical Distance
2.3 Universal Hashing
2.4 Secure Sketch
2.5 Learning with Error (LWE) Problem
3 Reusable Fuzzy Extractor
3.1 Construction of Reusable Fuzzy Extractor from LWE
4 Conclusion
References
A Reusable Fuzzy Extractor with Practical Storage Size: Modifying Canetti et al.'s Construction
1 Introduction
2 Preliminaries
2.1 Entropy
2.2 Fuzzy Extractor and Reusability
2.3 (,m)-Threshold Scheme
3 Canetti et al.'s Reusable Fuzzy Extractor
3.1 Sources with -Entropy k-Samples
3.2 Digital Lockers
3.3 Description
3.4 Analysis on Concrete Parameters
4 Our Construction and Analysis
4.1 Construction
4.2 Parameters and Security Analysis
4.3 Analysis on Concrete Parameters
5 Conclusion
References
21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State
1 Introduction
1.1 Our Contributions
2 Preliminaries
3 Modeling Card Games Without Secret State
4 The Framework
5 Optimizing Our Protocol
6 Concrete Complexity Analysis
References
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority
1 Introduction
1.1 Bit Decomposition and Modulus Conversion
1.2 Our Contribution
1.3 Technical Overview
1.4 Related Work
2 Preliminaries
2.1 Mersenne Prime
2.2 Security Model and Definition
2.3 Secret Sharing
3 Quotient Transfer
4 Bit-Decomposition Protocol
4.1 Equation for Bit Decomposition
4.2 Passively Secure Bit-Decomposition Protocol
4.3 Efficiency
4.4 Achieving Active Security Using Replicated SS
5 Modulus-Conversion Protocol
5.1 Generating a Pair of Random Shares
5.2 Modulus-Conversion Protocol from Z2u to Zp
5.3 Equation for Modulus Conversion
5.4 Our Modulus-Conversion Protocol
5.5 Efficiency
6 Experiments
7 Conclusion
References
Verifiable Secret Sharing Based on Hyperplane Geometry with Its Applications to Optimal Resilient Proactive Cryptosystems
1 Introduction
2 Related Works
3 Verifiable Secret Sharing Based on Hyperplane Geometry
3.1 Model and Assumptions
3.2 Verifiable Secret Sharing Based on Hyperplane Geometry
3.3 Security Analysis
3.4 Some Observations
4 A Proactive Secret Sharing Scheme
4.1 Model and Assumptions
4.2 The Proposed Scheme
4.3 Security Analysis
4.4 Efficiency Analysis
5 Discussion and Conclusion
References
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS
1 Introduction
2 Preliminaries
3 MFHE Scheme Without a CRS
3.1 Single-Key Ciphertext to Multi-key Ciphertext
3.2 Our Leveled MFHE Scheme
4 A Three Round MPC Protocol: Semi-malicious Security
4.1 A Three Round MPC Protocol via MFHE
5 Conclusion
References
Robust Multiparty Computation with Faster Verification Time
1 Introduction
2 Preliminaries
3 Description of the Compiler KZZ
3.1 Description of the Predicates Used in KZZ' Transactions
3.2 Description of the Sub-protocols Dep_Ref() and Claim()
3.3 Constructing KZZ' Using Dep_Ref() and Claim()
3.4 Comparing the Verification Times of KZZ and KZZ' Compilers
4 Feasibility of Implementing KZZ' Using Ethereum Contracts
5 Robustness Proof of KZZ' Compiler
6 Conclusion
References
Symmetric-Key Cryptography
Distributed Time-Memory Tradeoff Attacks on Ciphers
1 Introduction
2 Background on Time-Memory Tradeoff Attacks
2.1 Hellman's Attack
2.2 Babbage-Golic (BG) Tradeoff
2.3 Biryukov-Shamir (BS) Tradeoff
2.4 Hong-Sarkar (HS) Tradeoff
2.5 Dunkelman-Keller (DK) Approach
2.6 Other Work on TMTO Attacks
3 Distributed Hellman Attack
3.1 Distributed Approach to the Original Hellman Attack
3.2 Distributed Distinguished Points (DP) Method
3.3 Distributed Rainbow Table Method
4 Applying Distributed TMTO Attacks on Stream Ciphers
4.1 Distributed BG Attack
4.2 Distributed BS Attack
4.3 Distributed HS and DK Attacks
5 Applying Distributed TMTO Attacks to Counter Mode
5.1 Distributed Attack Without Data
5.2 Incorporating Data into the Attack
6 Conclusions
References
New Iterated RC4 Key Correlations
1 Introduction
1.1 Description of RC4
1.2 Description of WPA-TKIP
1.3 Our Contributions
1.4 Organization of This Paper
2 Previous Works
2.1 Known Key Correlations
2.2 Known Attacks in the Broadcast Setting
3 New Iterated RC4 Key Correlations
3.1 Our Observations
3.2 Proofs
3.3 Experimental Results
4 Improvements for Plaintext Recovery on WPA-TKIP
5 Conclusion
References
A New Framework for Finding Nonlinear Superpolies in Cube Attacks Against Trivium-Like Ciphers
1 Introduction
1.1 Our Contributions
1.2 Organization
2 Preliminaries
2.1 Trivium-Like Stream Ciphers
2.2 Cube Attacks
2.3 Linearity and Quadraticity Tests
3 A New Framework to Find Nonlinear Superpolies
3.1 Motivations
3.2 A Generic Technique for Linearity Tests of Composite Functions
3.3 A Generic Method of Choosing Useful Nonlinear Key Expressions
4 Application to Trivium-Like Stream Ciphers
4.1 Some Notes
4.2 Experimental Results
5 Conclusion
References
Differential Attacks on Reduced Round LILLIPUT
1 Introduction
2 LILLIPUT
3 Structure of the Attacks
3.1 Variance Method
3.2 Conditions on the Inputs and the Outputs
3.3 Complexity
3.4 Automated Research of Attacks
4 Distinguishing Attacks
4.1 First Rounds
4.2 Further Attacks
4.3 Simulation of Attacks on 6 and 7 Rounds
5 Key Recovery
5.1 Key Schedule Description
5.2 Related Key Attack on 6 Rounds
5.3 Key Recovery Analysis on 7 Rounds
5.4 Key Recovery Analysis on 8 Rounds
5.5 Key Recovery Analysis on More Rounds
6 Conclusion
References
Bounds on Differential and Linear Branch Number of Permutations
1 Introduction
2 Preliminaries
3 Bounds on Linear Branch Number
4 Bounds on Differential Branch Number
4.1 Differential Branch Number of Permutations of F24
4.2 Differential Branch Number of Permutations of F2n, for n 5
4.3 Comparison with Griesmer Bound
5 Conclusions
References
Keyed Sponge with Prefix-Free Padding: Independence Between Capacity and Online Queries Without the Suffix Key
1 Introduction
2 Preliminaries
3 Keyed Sponge with Prefix-Free Padding
4 PRF-Security of KSpongePF
4.1 Proof of Theorem 1
4.2 Upper-Bound of Pr[WorldR] - Pr[WorldM]
4.3 Upper Bound of Pr[WorldM] - Pr[WorldI]
5 Conclusion
References
Public-Key Cryptography
Forward-Secure Linkable Ring Signatures
1 Introduction
1.1 Our Results
1.2 Related Work
2 Definitions
2.1 Correctness Notions
2.2 Security Model
3 Multilinear Maps
3.1 Multilinear Assumptions
3.2 Is Multilinearity Achievable?
4 Construction
5 Correctness
6 Security
7 Generalisations and Bilinear Maps
References
Revocable Identity-Based Encryption from the Computational Diffie-Hellman Problem
1 Introduction
1.1 Our Contributions
1.2 Paper Organization
2 Preliminaries
2.1 Notations
2.2 Pseudorandom Functions
2.3 Revocable Identity-Based Encryption
2.4 Garbled Circuits
2.5 Computational Diffie-Hellman Problem
2.6 Chameleon Encryption
3 Idea of Our Revocable IBE Scheme
3.1 Idea of the DG Scheme
3.2 Idea of Our Revoked IBE Scheme
4 Revocable IBE Scheme
4.1 Correctness
4.2 Security
5 Performance Analysis of Key Updating
References
Private Functional Signatures: Definition and Construction
1 Introduction
1.1 Our Contributions
1.2 Related Work
1.3 Overview of Our Techniques
1.4 Applications
2 Preliminaries
2.1 Garbled Circuits
2.2 Symmetric-Key Two-Outcome Predicate Encryption
3 Private Functional Signatures: Definition and Construction
3.1 Formal Definition
3.2 Privacy
4 Construction
4.1 Unforgeability
4.2 Privacy
4.3 Discussions
5 Appendix
5.1 Signature Schemes
5.2 Symmetric-Key Predicate Encryption
5.3 Proofs in the First Step
5.4 Proof in the Second Step
References
Linkable Group Signature for Auditing Anonymous Communication
1 Introduction
1.1 Our Contribution
1.2 Related Work
1.3 Paper Organization
2 Trapdoor Indicative Commitment
3 Linkable Group Signature
3.1 System Model
3.2 Security Definitions
4 Generic Construction of Linkable Group Signature
4.1 Generic Construction
4.2 Security Analysis
5 Instantiating Linkable Group Signature
5.1 Linkable Group Signature Implementation
5.2 Security Analysis of Proposed LGS
5.3 Performance Analysis of Proposed LGS
6 Conclusion
References
Auditable Hierarchy-Private Public-Key Encryption
1 Introduction
1.1 Our Contribution
1.2 Related Work
2 Trapdoor Distinguishable Commitment
3 Auditable Hierarchy-Private Encryption
3.1 System Model
3.2 Security Definitions
4 Construction
4.1 A Bird View
4.2 Generic Construction
4.3 Concrete Implementation
5 Comparison
6 Conclusion
References
Key-Updatable Public-Key Encryption with Keyword Search: Models and Generic Constructions
1 Introduction
1.1 Our Contribution
1.2 Related Works
2 Preliminaries
2.1 Public-Key Encryption with Keyword Search
2.2 Key-Insulated Public-Key Encryption
3 KU-PEKS in the Key-Evolution Model
3.1 Model
3.2 Generic Construction from PKE and PEKS
4 KU-PEKS in the Key-Insulation Model
4.1 Model
4.2 Building Block: Anonymous Key-Insulated IBE for Master Keys
4.3 Generic Construction from KI-PKE and MIKE
5 Efficiency Comparison and Implementation
References
Anonymous Identity-Based Encryption with Identity Recovery
1 Introduction
1.1 Our Contributions
1.2 Related Work
2 Preliminaries and Definitions
2.1 Bilinear Groups
2.2 Identity-Based Encryption
2.3 Testable Identity-Based Encryption
3 Anonymous Identity-Based Encryption with Identity Recovery
4 A Construction from Anonymous IBE and Testable IBE
4.1 The Construction
4.2 Correctness
4.3 Anonymity
4.4 Stronger Semantic Security
4.5 Recovery
5 Conclusion
References
Asymmetric Subversion Attacks on Signature Schemes
1 Introduction
1.1 Overview of Our Contributions
2 Preliminaries
2.1 Notations
2.2 Cryptographic Hardness Assumptions
2.3 Signature Schemes
3 Asymmetric Subversion Model for Signature Schemes
3.1 An Overview
3.2 Strong Secret Undetectability
3.3 Signing Key Recoverability
4 Mounting AS-SA on Signature Schemes
4.1 Definitions of Splittable Signatures
4.2 A Universal AS-SA on Splittable Signature Schemes
4.3 Instantiations
5 Subversion-Resilient Signatures
6 Conclusions
References
Cloud Security
Intrusion-Resilient Public Auditing Protocol for Data Storage in Cloud Computing
1 Introduction
1.1 Our Contributions
2 Definitions and Preliminaries
2.1 System Model
2.2 Definition of Intrusion-Resilient Public Auditing Protocol
2.3 Definition of Security
2.4 Preliminaries
3 The Proposed Protocol
3.1 Technique Explanation
3.2 Description of the Proposed Protocol
4 Security Analysis
5 Performance Analysis
6 Conclusion
References
Secure Publicly Verifiable Computation with Polynomial Commitment in Cloud Computing
1 Introduction
2 Related Work
3 Preliminaries
3.1 Bilinear Pairing
3.2 Polynomial Commitment
4 Problem Statement
4.1 The System Model
4.2 Threat Model
4.3 Design Goals
5 The Proposed Scheme
6 Security Analysis and Performance Analysis
6.1 Security Analysis
6.2 Performance Analysis
7 Conclusion
References
Privacy-Preserving Mining of Association Rule on Outsourced Cloud Data from Multiple Parties
1 Introduction
2 Preliminaries
2.1 Frequent Itemset Mining and Association Rule Mining
2.2 BCP Cryptosystem
3 System Model and Design Goal
3.1 Problem Statement
3.2 System Model
3.3 Threat Model
3.4 Design Goals
4 Privacy-Preserving Frequent Itemset Mining and Association Rule Mining
4.1 Setup
4.2 Privacy-Preserving Building Blocks
4.3 Secure Frequent Itemset Mining
4.4 Secure Association Rule Mining
5 Security Analysis
5.1 Security of Cryptographic Blocks
5.2 Security of SFIM and SARM
6 Performance Analysis
6.1 Experiment Analysis
7 Conclusions
References
Post-quantum Cryptography
Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC'08
1 Introduction
2 Preliminaries
2.1 Lattices
2.2 Lattice Problems and Algorithms
3 The PSW Digital Signature Scheme
3.1 The Original Signature Scheme
3.2 The Randomized Version of PSW Signature Scheme
4 The Chosen Message Attack Against the Randomized Version of PSW Scheme
4.1 Key Idea of Our Chosen Message Attack
4.2 Our Strategy to Collect the Difference Vectors
4.3 Experimental Results
5 Possible Ways to Fix the Randomized Version
6 Conclusions and Open Problems
References
Complete Attack on RLWE Key Exchange with Reused Keys, Without Signal Leakage
1 Introduction
1.1 Previous Work
1.2 Our Contributions
2 Organization
3 Preliminaries
3.1 Notation
3.2 Learning with Errors and RLWE
4 The Protocol
5 New Attack Using Key Mismatch - One Pass Case
5.1 Simplified Attack
5.2 Extending the Attack When Adding the Error gB
5.3 Improved Attack
5.4 Determining Index j Such that sB[j] = 1
5.5 Adversary Query Complexity
5.6 Experiments
6 Extending Signal Function Attack
7 Signal Function Attack with Reduced Query Complexity
8 Conclusion
References
Efficient Decryption Algorithms for Extension Field Cancellation Type Encryption Schemes
1 Introduction
2 Extension Field Cancellation (EFC)
2.1 Notations
2.2 Construction of the EFCp- Schemes
2.3 Construction of the EFCpt2- Scheme
3 Our Proposed Efficient Decryption Algorithms for EFCp- and EFCpt2-
3.1 New Decryption Algorithm for EFCp-
3.2 New Decryption Algorithm for EFCpt2-
3.3 Implementation and Comparison
4 Conclusion
References
Lattice-Based Universal Accumulator with Nonmembership Arguments
1 Introduction
1.1 Our Contribution
1.2 Related Work
1.3 Organization of This Work
2 Preliminaries
2.1 Cryptographic Assumption
2.2 Universal Accumulator
2.3 Abstract Stern's Protocol
3 Lattice-Based Universal Accumulator
3.1 Our Construction of Accumulator for Nonmembership
3.2 Zero-Knowledge Argument of Knowledge of Nonmembership Witness
4 Application of Our Accumulator
A Zero-Knowledge Arguments of Knowledge
B Accumulator for Nonmembership
References
Lattice-Based Dual Receiver Encryption and More
1 Introduction
1.1 Our Contributions
2 Preliminaries
2.1 Encoding Vectors into Matrices
2.2 (Identity-Based) Dual Receiver Encryption
3 Dual Receiver Encryption Construction
3.1 Correctness and Parameter Selection
3.2 Security Proof
4 Identity-Based Dual Receiver Encryption Construction from Lattice
4.1 Correctness and Parameter Selection
4.2 Security Proof
4.3 Extension: ID-DRE with More Compact Parameters
5 Conclusion
References
Anonymous Identity-Based Hash Proof System from Lattices in the Standard Model
1 Introduction
1.1 Our Contributions
1.2 Our Technologies
1.3 Other Related Work
1.4 Paper Organization
2 Preliminaries
2.1 Notations
2.2 Extractors and Leftover-Hash Lemma
2.3 Lattices
2.4 Gaussians on Lattices
2.5 Learning with Errors (LWE)
3 Selectively Secure Construction in the Standard Model
3.1 Construction
3.2 Parameter Setting
3.3 Proof for IB-HPS in Sect.3
4 Conclusion
A Anonymous Identity-Based Hash Proof Systems
B Proof of Lemma 13
C Proof of Lemma 15
References
Post-Quantum One-Time Linkable Ring Signature and Application to Ring Confidential Transactions in Blockchain (Lattice RingCT v1.0)
1 Introduction
1.1 Contribution
2 Related Work
3 Preliminaries
4 Security Model
4.1 Structure of Lattice-Based One-Time Linkable Ring Signature (L2RS)
4.2 Oracles for Adversaries
4.3 Threat Model
5 Our Proposed L2RS Scheme
5.1 Setup
5.2 Key Generation - KeyGen
5.3 Signature Generation - SigGen
5.4 Signature Verification - SigVer
5.5 Signature Linkability - SigLink
6 Security Analysis
7 Lattice RingCT v1.0 Protocol
7.1 Scheme Construction
8 Performance Analysis
References
Security Protocol
Secure Contactless Payment
1 Introduction
2 Definitions
2.1 Contactless Payment
2.2 Preliminaries About Public Key Distance Bounding
3 Contactless Payment Protocol
3.1 ClessPay
3.2 Security
4 EMV Analysis
5 Conclusion
References
New Attacks and Secure Design for Anonymous Distance-Bounding
1 Introduction
2 Preliminaries
2.1 DBID
3 New Attacks on Anonymous DB Protocols
3.1 Directional TF Attack on Anonymous DB
3.2 Collusion TF on Anonymous DB
4 Anonymous DB Model
5 AnonDB Construction: dbid2anGM
6 Conclusion
References
System and Network Security
Automatically Identifying Security Bug Reports via Multitype Features Analysis
1 Introduction
2 Related Work
3 Design of SBRer
3.1 Overview of SBRer
3.2 Step 1: Feature Extraction from Training Bug Reports
3.3 Step 2: Feature Vector Generator for Training Bug Reports
3.4 Step 3: Training Machine Learning Model
4 Experiments and Results
4.1 Evaluation Metrics
4.2 Datasets
4.3 Experiments and Discussion
5 Conclusion
References
A Practical Privacy Preserving Protocol in Database-Driven Cognitive Radio Networks
1 Introduction
2 Related Works
3 Preliminaries
3.1 System Model
3.2 Security Requirements
3.3 Modular Square Root Technique
4 Proposed Scheme
4.1 Channel Prediction
4.2 Channel Allocation
5 Security Analysis and Performance Evaluation
5.1 Security Analysis
5.2 Performance Evaluation
6 Conclusion
References
TDDAD: Time-Based Detection and Defense Scheme Against DDoS Attack on SDN Controller
1 Introduction
1.1 Related Work
1.2 Our Contributions
2 Background
2.1 OpenFlow
2.2 BPNN
3 Our Scheme
3.1 Statistics Collection Module
3.2 Feature Extraction Module
3.3 Attack Detection Module
3.4 Attack Defense Module
3.5 Port Recovery Module
4 Experiment and Evaluation
4.1 Experiment Parameter
4.2 Accuracy and Recall
4.3 Promptness
4.4 Versatility
4.5 Recovery
5 Conclusion
References
Blockchain and Cryptocurrency
Fast Lottery-Based Micropayments for Decentralized Currencies
1 Introduction
2 Preliminary
2.1 Background on Bitcoin
2.2 Accountable Assertions
2.3 Assumptions and Building Blocks
3 Fast Lottery-Based Micropayments
3.1 Security Definitions
3.2 A Brief Review of the Scheme in CCS'15
3.3 Our Protocol
3.4 Security Analysis
4 Performance Comparison
5 Conclusion
A Proofs for Theorems
References
Z-Channel: Scalable and Efficient Scheme in Zerocash
1 Introduction
1.1 Our Contribution
1.2 Paper Organization
2 Preliminaries
2.1 Background on Zk-SNARKs
2.2 The Zerocash Scheme
2.3 Micropayment Channel
2.4 Distributed Signature Generation Scheme
3 DAP Plus: Improved Decentralized Anonymous Payment Scheme
3.1 Main Idea of DAP Plus Scheme
3.2 Construction of DAP Plus Scheme
3.3 Security of DAP Plus Scheme
4 Z-Channel
4.1 Main Idea of Z-Channel
4.2 Construction of Z-Channel Protocol
4.3 Security of Z-Channel Protocol
5 Performance Analysis
5.1 Instantiation of DAP Plus and Z-Channel
5.2 Performance of Zero-Knowledge Proof in DAP Plus
5.3 Performance of Z-Channel Protocol Between Single Pairs
6 Conclusion
References
Revisiting the Incentive Mechanism of Bitcoin-NG
1 Introduction
1.1 Related Work
2 Contrasting Bitcoin-NG Blockchain and Bitcoin Blockchain
3 Bitcoin-NG Incentive Mechanism
3.1 Heaviest Chain Extension
3.2 Transaction Inclusion
3.3 Longest Chain Extension
4 Amendment of the Original Bitcoin-NG Protocol
4.1 Negligence in Transaction Inclusion Inequation and Its Amendment
4.2 Over-Simplification in Longest Chain Extension Inequation and Its Improvement
5 Analysis of the Optimal Proportion of Transaction Fee Distribution
5.1 The Definition of the Optimal rleader
5.2 Calculation of the Optimal rleader
6 Conclusion
References
Decentralized Blacklistable Anonymous Credentials with Reputation
1 Introduction
1.1 Our Results
2 Notation
3 Syntax and Security Goals
3.1 The Syntax
3.2 The Security
4 General Construction
4.1 Building Blocks
4.2 The Construction
5 The Instantiations
6 The Implementation
6.1 The Public Ledger
6.2 The Credential System
7 Conclusion
References
Short Papers
Revocable Certificateless Encryption with Ciphertext Evolution
1 Introduction
2 Definition and Security Model
2.1 Revocable Certificateless Encryption with Ciphertext Evolution
2.2 The Security Model
2.3 Bilinear Paring and Complexity Problem
3 Revocable Certificateless Encryption with Ciphertext Evolution
3.1 The Construction
3.2 The Security
3.3 The Comparison
4 Conclusion
References
A New Encryption Scheme Based on Rank Metric Codes
1 Introduction
2 Preliminaries
3 A New Encryption Scheme
4 IND-CPA Secure Encryption
5 Our Encryption Based on Gabidulin Codes
6 Conclusion
References
Enhancing Intelligent Alarm Reduction for Distributed Intrusion Detection Systems via Edge Computing
1 Introduction
2 Our Approach
2.1 Edge Computing
2.2 Our Framework
3 Evaluation
3.1 Experimental Settings
3.2 Experimental Results
4 Related Work
5 Conclusion
References
Live Path CFI Against Control Flow Hijacking Attacks
1 Introduction
2 Related Works
3 LPCFI Approach
3.1 Program Representation
3.2 Data Structures
3.3 Instrumentation
4 Implementation
4.1 Instrumentation and Data Structure
4.2 Lookup Operation on the fp-table
4.3 Security Guarantee
5 Proof-of-Concept Attack and Defence
6 Conclusion
References
Security Analysis and Modification of ID-Based Encryption with Equality Test from ACISP 2017
1 Introduction
2 Wu et al.'s IBEET Scheme
3 Our Attack Against Wu et al.'s IBEET Scheme
4 Our Modification
5 Conclusion
References
Improving the BKZ Reduction Algorithm by Quick Reordering Technique
1 Introduction
2 Preliminaries
3 Our Proposed Method
3.1 SE-ENUM with Quick Reordering Technique
3.2 Theoretical Estimation
4 Improving BKZ by the Quick Reordering Technique
4.1 The BKZ Algorithm with Increasing QRT
4.2 Experimental Results
5 Conclusion
References
ANTSdroid: Automatic Malware Family Behaviour Generation and Analysis for Android Apps
Abstract
1 Introduction
2 Related Work
3 System Design
3.1 Generate All_APIs Execution Trace per Thread
3.2 Filtering for Sensitive and Permission-Related APIs
3.3 Malware Family Global Execution Sequence Alignment and Segmentation and Stage Chart Generation
4 Evaluation
5 Conclusion and Future Work
References
Constant-Size CCA-Secure Multi-hop Unidirectional Proxy Re-encryption from Indistinguishability Obfuscation
1 Introduction
2 Our Proposed Scheme
References
Practical Signatures from the Partial Fourier Recovery Problem Revisited: A Provably-Secure and Gaussian-Distributed Construction
1 Introduction
1.1 Related Work
2 Preliminary
2.1 Notation
2.2 Digital Signatures
2.3 Hardness Assumption
3 Construction
4 Practical Instantiation
References
CRT-KPS: A Key Predistribution Schemes Using CRT
1 Introduction
1.1 Security and Key Management Issues: Motivation
1.2 Contribution and Organization of Our Work
2 Key Predistribution Schemes (KPS) Based on CRT
2.1 CRT-KPS: A Novel Distributed KPS Using CRT
3 Analyses with Comparative Study
4 Conclusion and Future Works
References
Correction to: Fast Lottery-Based Micropayments for Decentralized Currencies
Correction to: Chapter "Fast Lottery-Based Micropayments for Decentralized Currencies" in: W. Susilo and G. Yang (Eds.): Information Security and Privacy, LNCS 10946, https://doi.org/10.1007/978-3-319-93638-3_38
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Information Security and Privacy

Description

More details

Other editions

Additional editions

Content

System requirements