Information security and privacy : 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings / Willy Susilo, Guomin Yang (eds.)
This book constitutes the refereed proceedings of the 23rd Australasian Conference on Information Security and Privacy, ACISP 2018, held in Wollongong, Australia, in July 2018. The 41 revised full papers and 10 short papers presented were carefully revised and selected from 136 submissions. The pape...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Corporate Author: | |
| Other Authors: | , |
| Other title: | ACISP 2018. |
| Format: | Conference Proceeding eBook |
| Language: | English |
| Published: |
Cham, Switzerland :
Springer,
[2018]
|
| Series: | Lecture notes in computer science ;
10946. LNCS sublibrary. Security and cryptology. |
| Subjects: |
Table of Contents:
- 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.