Information Security and Privacy 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3-5, 2017, Proceedings, Part I
Saved in:
Main Authors | , |
---|---|
Format | eBook |
Language | English |
Published |
Cham
Springer International Publishing AG
2017
|
Edition | 1 |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Table of Contents:
- 2.3 Public-Key Encryption and Key-Dependent Message Security -- 3 Multi-fold LPN on Squared-Log Entropy -- 3.1 Multi-fold LPN on Squared-Log Entropy with Independent Secrets -- 3.2 Multi-fold LPN on Squared-Log Entropy with Independent Sample Subspaces -- 4 KDM-Secure PKE from Constant-Noise LPN -- 4.1 The Construction -- 4.2 Correctness -- 4.3 KDM-Security for Affine Functions -- References -- Long-Term Secure Commitments via Extractable-Binding Commitments -- 1 Introduction -- 2 Preliminaries -- 3 Extractable-Binding Commitments -- 4 Long-Term Commitments -- 4.1 Scheme Description -- 4.2 Security Model -- 5 Security Analysis -- 6 Evaluation -- 7 Conclusions and Open Questions -- References -- Attribute-Based Encryption -- New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption -- 1 Introduction -- 1.1 Backgrounds -- 1.2 Our Results -- 1.3 Key Techniques -- 1.4 Notations -- 2 Dual Pairing Vector Spaces (DPVS) -- 3 Definition of KP-ABE -- 3.1 Span Programs and Access Structures -- 3.2 Key-Policy Attribute-Based Encryption (KP-ABE) -- 4 Special Matrix Subgroups -- 5 Adaptively Secure Multi-Use KP-ABE Scheme with Short Ciphertexts -- 5.1 Key Ideas in Constructing the Proposed KP-ABE Scheme -- 5.2 Dual Orthonormal Basis Generator -- 5.3 Warm-Up: Underlying Semi-adaptively Secure Construction -- 5.4 Proposed Adaptively Secure Construction -- A Decisional Linear (DLIN) Assumption -- B Adaptively Secure Multi-Use CP-ABE Scheme with Short Secret Keys -- B.1 Definition of CP-ABE -- B.2 Dual Orthonormal Basis Generator -- B.3 Construction -- References -- Attribute-Based Encryption with Expressive and Authorized Keyword Search -- 1 Introduction -- 1.1 Related Work -- 1.2 Organization -- 2 Preliminaries -- 2.1 Bilinear Pairings -- 2.2 Access Structure and Linear Secret Sharing -- 2.3 Attribute-Based Encryption
- Intro -- Preface -- ACISP 2017 -- Abstracts of Invited Talks -- Jennifer Seberry Lecture: Contextual Privacy -- Key Note Lecture: Security as Risk Communication -- Key Note Lecture: I Was Sure that Was My Password… and Other Just so Law Enforcement Stories -- Graphical Security Models -- Compact-LWE for Lightweight Public Key Encryption and Leveled IoT Authentication -- Orchestration and Automation of Cybersecurity: Issues and Challenges -- UniteCloud: A Resilient Private Cloud Platform for Education and Research Service -- Software Defined Networking as a Security Enabler for Enterprises -- Mobile Phone Security Issues -- Contents -- Part I -- Contents -- Part II -- Public Key Encryption -- Tightly-Secure Encryption in the Multi-user, Multi-challenge Setting with Improved Efficiency -- 1 Introduction -- 2 Preliminaries -- 3 Simulatable Two-Tier Signatures -- 4 Tightly Secure Signatures -- 5 Tight Simulation Extractable NIZK (SE-NIZK) -- 6 Tightly IND-CCA Secure PKE in the Multi-User/-challenge Setting -- A Examples of Simulatable Two-Tier Signatures -- B Illustration of TreeSig -- C Proof of Theorem 1 -- References -- Hierarchical Functional Encryption for Linear Transformations -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 1.3 Paper Organisation -- 2 Preliminaries -- 2.1 Notations -- 2.2 Subset Membership Problems -- 2.3 Hash Proof System -- 2.4 Functional Encryption -- 3 Hierarchical Functional Encryption for Linear Transformations -- 3.1 Definition -- 3.2 Construction -- 3.3 Security Proof -- 3.4 Extensions -- 4 Instantiations -- 4.1 HFE-LT from DDH -- 4.2 HFE-LT Instantiation from DCR -- 5 Conclusion -- References -- KDM-Secure Public-Key Encryption from Constant-Noise LPN -- 1 Introduction -- 2 Preliminaries -- 2.1 Useful Distributions and Lemmas -- 2.2 Learning Parity with Noise
- 2.4 Symmetric Encryption -- 2.5 Expressive Keyword Search -- 3 System Architecture and Security Model -- 3.1 System Architecture -- 3.2 Framework -- 3.3 Security Definitions -- 4 Generic Construction and Its Extensions -- 4.1 Generic Construction -- 4.2 Security Proof -- 4.3 Extensions -- 4.4 Performance Analysis -- 5 Conclusions -- References -- Towards Revocable Fine-Grained Encryption of Cloud Data: Reducing Trust upon Cloud -- 1 Introduction -- 2 Description and Formulation of the System -- 2.1 System Setting -- 2.2 Formulation of the System -- 3 Our Constructions -- 3.1 Scheme One -- 3.2 Scheme Two -- 4 Experimental Results -- 5 Related Work -- 6 Conclusions -- References -- Identity-Based Encryption -- Mergeable and Revocable Identity-Based Encryption -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions -- 1.3 Paper Organization -- 2 Preliminaries -- 2.1 Notations -- 2.2 Bilinear Map -- 2.3 Pseudorandom Function Family -- 2.4 Threshold Secret Sharing Scheme -- 2.5 Fuzzy Identity-Based Encryption Scheme -- 2.6 Identity-Based Encryption with Revocation Scheme -- 3 Formal Definitions and Security Models -- 3.1 Syntax of Mergeable and Revocable IBE -- 3.2 Security of Mergeable and Revocable IBE -- 4 The Proposed Schemes -- 5 Security Proof -- 6 Conclusions -- A Security Proof -- A.1 Analysis -- References -- ID-Based Encryption with Equality Test Against Insider Attack -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 1.3 Organization -- 2 Preliminaries -- 2.1 Bilinear Diffie-Hellman Problem (BDHP) -- 3 Definitions -- 3.1 ID-Based Encryption with Equality Test Against Insider Attack -- 3.2 Security Models -- 4 The Proposed Scheme -- 4.1 ID-Based Encryption with Equality Test Against Insider Attack -- 4.2 Correctness -- 5 Security Analysis -- 5.1 W-IND-ID-CCA Security -- 6 Experiments on a Database
- 2.1 Lattice Based Method
- 5 Experiments -- 5.1 The Time of Index Generation -- 5.2 The Time of Trapdoor Generation -- 5.3 The Time of Fuzzy Keyword Search -- 6 Security Analysis -- 7 Related Work -- References -- Secure and Practical Searchable Encryption: A Position Paper -- 1 Introduction -- 2 Requirements and Challenges -- 3 Literature Review -- 4 Possible Solutions and Future Research -- 5 Concluding Remarks -- References -- Cryptanalysis -- Fault Attacks on XEX Mode with Application to Certain Authenticated Encryption Modes -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Notations -- 2.2 AES Description -- 2.3 The Design of XEX Mode -- 3 Eliminating the Masks in XEX Mode -- 3.1 Stuck-At-Zero Fault Attack -- 3.2 Skipping an Instruction Fault Attack -- 3.3 Security Implication for Mask Elimination -- 4 A Ciphertext only Attack to Reveal Secret Mask L -- 4.1 Fault Model A at Round 9 -- 4.2 Fault Model A at Round 8 -- 4.3 Fault Model B at Round 9 -- 5 Application to Authenticated Encryption Modes -- 6 Countermeasures -- 7 Conclusion -- References -- How to Handle Rainbow Tables with External Memory -- 1 Introduction -- 2 Primer on Rainbow Tables -- 2.1 Mode of Operation -- 2.2 Precomputations -- 2.3 Attack -- 3 Performance of the Algorithms -- 3.1 Terminology and Assumptions -- 3.2 Algo DLU -- 3.3 Algo STL -- 4 Algorithm Constants -- 4.1 Experimental Setup -- 4.2 Determination of Values for S, L and F -- 5 Analysis -- 5.1 Comparing Algo STL and Algo DLU -- 5.2 Comparison with RAM -- 5.3 HDD and SSD -- 5.4 Discussion -- 6 Experimentation -- 6.1 Parameters and Methodology -- 6.2 Paging and Caching Mechanisms -- 6.3 Reducing the Caching Impact -- 6.4 Experimental Results -- 7 Conclusion -- References -- Improved Factoring Attacks on Multi-prime RSA with Small Prime Difference -- 1 Introduction -- 1.1 Background -- 1.2 Our Contribution -- 2 Preliminaries
- 6.1 Setup of Experiments -- 6.2 Performance Evaluation -- 6.3 Comparison -- 7 Conclusions -- References -- Lattice-Based Revocable Identity-Based Encryption with Bounded Decryption Key Exposure Resistance -- 1 Introduction -- 1.1 Background -- 1.2 Our Contributions -- 1.3 Our Approach -- 2 Preliminaries -- 3 B-DKER RIBE -- 4 Construction -- 5 Security -- 6 Discussion -- References -- Searchable Encryption -- Dynamic Searchable Symmetric Encryption with Physical Deletion and Small Leakage -- 1 Introduction -- 1.1 Our Main Ideas -- 1.2 Our Contributions -- 1.3 Organization of the Remainder -- 2 Defining Symbols and Data Structures -- 3 Defining DSSE and Its Security -- 4 Our Basic DSSE Scheme D-I -- 5 Our Basic DSSE Scheme D-II -- 6 Our Complete DSSE Scheme -- 6.1 Provable IND-CKA2 Security -- 7 Comparisons and Experiments -- 8 Other Related Works -- 9 Conclusion -- References -- Multi-user Cloud-Based Secure Keyword Search -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Works -- 2 Preliminaries -- 2.1 Notations -- 2.2 Threshold Secret Sharing -- 2.3 Pseudorandom Functions (PRFs) -- 2.4 OXT -- 3 Syntax of Multi-user SSE -- 4 Security Definitions of Multi-user SSE -- 4.1 Privacy Against Server -- 4.2 Query Privacy Against Other Key Share Holders -- 5 Randomizable Key Homomorphic Distributed PRFs -- 5.1 Definition -- 5.2 PRF Evaluation Protocol -- 5.3 Concrete Construction of RDPRF -- 6 Our Construction -- 7 Security Analysis -- 8 Performance Comparison -- 9 Further Extension -- 10 Conclusions -- References -- Fuzzy Keyword Search and Access Control over Ciphertexts in Cloud Computing -- 1 Introduction -- 2 Preliminaries -- 3 Word Pattern -- 4 Fuzzy Keyword Search Supporting Access Control -- 4.1 System Setup -- 4.2 Building Index -- 4.3 Trapdoor Generation -- 4.4 Theorem and Property for FKS-AC -- 4.5 Fuzzy Keyword Search with Access Control