Progress in Cryptology - LATINCRYPT 2017

Name: Progress in Cryptology - LATINCRYPT 2017 | 5th International Conference on Cryptology and Information Security in Latin America, Havana, Cuba, September 20-22, 2017, Revised Selected Papers
Brand: Springer
Price: 69.54 EUR
Availability: OnlineOnly

5th International Conference on Cryptology and Information Security in Latin America, Havana, Cuba, September 20-22, 2017, Revised Selected Papers

Tanja Lange Orr Dunkelman(Editor)

Springer (Publisher)

Published on 19. July 2019

XIII, 415 pages

E-Book

PDF with digital watermarking

System requirements

978-3-030-25283-0 (ISBN)

€69.54incl. 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 Progress in Cryptology - LATINCRYPT 2017
Contents
Invited Talk
An Obsession with Definitions
1 Introduction
2 Garbling Schemes
3 Online AE
4 Onion Encryption
5 Conclusions
References
Security Protocols
Anonymous Single-Round Server-Aided Verification
1 Introduction
1.1 Previous Work
1.2 Contributions
2 Preliminaries
2.1 Signature Schemes
2.2 Verifiable Computation
3 Single-Round Server-Aided Verification
4 Security Model
4.1 Unforgeability
4.2 Soundness Against Collusion
4.3 Anonymity
5 A Compiler for SAV
5.1 Description of Our Compiler
5.2 Security of Our Generic Composition
6 New Instantiations of SAV Schemes
6.1 A Secure SAV for BLS (SAVCDS1BLS)
6.2 A Secure SAV for Wat (SAVCDS1Wat)
6.3 The First SAV for CL (SAVCDS2CL)
6.4 Comparison with Previous Work
7 Conclusions
A Detailed Descriptions of Our SAV Schemes
References
Secure Channels and Termination: The Last Word on TLS
1 Introduction
2 Channels
2.1 Definitions
3 Keyed Two-Party StLHAE Channel Protocol Security
4 Secure Termination
4.1 Closure Alerts and Channel Closure
4.2 Secure Termination Experiment
4.3 Reduction to StLHAE Security
5 Secure Channels and Termination in TLS 1.2
5.1 Comparing Channel Protocols and ACCE
5.2 Secure Termination in TLS
A stLHAE Syntax and Security
References
Improved Security Notions for Proxy Re-Encryption to Enforce Access Control
1 Introduction
2 Preliminaries
2.1 Additional Properties
2.2 Existing Work
3 Indistinguishability
4 Token Robustness
5 Directionality Revisited
5.1 Problems with Traditional Directionality
5.2 Directionality Reconsidered
5.3 Existing Schemes Under the New Definition
6 Proxy Re-Encryption in the Malicious Model
7 Ciphertext Origin Authentication
7.1 Authentication with Corrupted Users
7.2 Correctness upon Verification
7.3 COA in Other Schemes
8 Conclusions and Open Problems
A Common Definitions for Confidentiality in PRE
B A Secure PRE Scheme in the Malicious Model
B.1 Security Analysis
References
Public-Key Implementation
Optimal 2-3 Chains for Scalar Multiplication
1 Introduction
2 Background
2.1 Double-Base Chains
2.2 Algorithm of Capuñay and Thériault
2.3 Other Approaches
3 Reducing the Complexity
3.1 Reduced Memory by Retracing the Steps
3.2 Order of the Steps
3.3 Efficient Computation of the Possible Sources
3.4 Using Only the Binary Representations
3.5 Algorithm
4 Other Double-Base and Triple-Base Systems
4.1 2-5 Chains
4.2 3-5 Chains
5 Implementation with Limited Memory
6 Experimental Results
7 Conclusion
A Triple-base chains
References
Curve25519 for the Cortex-M4 and Beyond
1 Introduction
2 ARMv7 Architecture
3 Related Work
3.1 Scalar Multiplication
3.2 Modular Multiplication
3.3 Modular Squaring
4 Implementation of F2255 - 19 Arithmetic
4.1 Multiplication
4.2 Squaring
5 Elliptic Curves
5.1 Elliptic Curve Diffie Hellman
5.2 Ed25519 Digital Signatures
6 Implementation Details and Results
6.1 Field Arithmetic
6.2 X25519 Implementation
6.3 Ed25519 Implementation
References
Implementing the NewHope-Simple Key Exchange on Low-Cost FPGAs
1 Introduction
1.1 Related Work
1.2 Contribution
2 Preliminaries
2.1 Notation
2.2 The NewHope Scheme
2.3 Binomial Sampling
2.4 Number-Theoretic Transform (NTT)
3 FPGA Implementation
3.1 Overview
3.2 Efficient Implementation of NTT
3.3 Point-Wise Multiplication
3.4 Generation of a
3.5 Binomial Sampling
3.6 Hash Function
3.7 Compression
4 Results and Comparison
4.1 Evaluation Methodology
4.2 Results
4.3 Comparison
5 Conclusion
References
Cryptanalysis
Theoretical Security Evaluation Against Side-Channel Cube Attack with Key Enumeration
1 Introduction
1.1 Background
1.2 Contribution
2 Side-Channel Cube Attack
2.1 Outline of Side-Channel Cube Attack dinur2009cube
2.2 Error-Tolerant Side-Channel Cube Attack
2.3 Previous Method for BSC Model li2013new
3 Side-Channel Cube Attack with Key Enumeration
3.1 Divide-and-Conquer Strategy and Key Enumeration
3.2 Proposed Algorithm
3.3 Complexity Estimation
4 Evaluation Method for Side-Channel Cube Attack with Key Enumeration
4.1 Cube Search
4.2 Information-Theoretic Evaluation
4.3 Experimental Evaluation by Rank Estimation
5 Application to PRESENT
5.1 Cubes of PRESENT
5.2 Security Evaluation of PRESENT
5.3 Comparison with the Previous Method
6 Conclusions and Open Problems
A Intuitive Explanation for the Observation
B Rank Estimation Algorithm of glowacz2015simpler
C Proof for Proposition 1
References
On the Hardness of the Mersenne Low Hamming Ratio Assumption
1 Introduction
2 Outline of the Analysis
2.1 Using LLL to Spread Information
2.2 Partition and Try
3 Experiment
3.1 Recovering F and G from H
4 Predicting the Total Execution Time
4.1 Naive Attack
5 Conclusion
References
Energy-Efficient ARM64 Cluster with Cryptanalytic Applications
1 Introduction
2 Building a Cheap Cluster
3 The ARM Cortex-A53
3.1 Determining Hardware Characteristics
4 Breaking ECC on the Cortex-A53
4.1 Distributed Pollard Rho
4.2 Iteration Function
4.3 Bitslicing
4.4 Optimising Multiplications
4.5 Pollard Rho Iterations Per Second
5 Results and Comparison
5.1 Benchmarking Multiplications
5.2 Energy Usage
5.3 Comparison with Other Hardware
A Cortex-A53 Benchmarking Results
A.1 Operations On ``Normal'' Registers
A.2 Operations On NEON Vector Registers
B The ECC2K-130 Challenge Parameters
References
Theory of Symmetric-Key Cryptography
Generation of 8-Bit S-Boxes Having Almost Optimal Cryptographic Properties Using Smaller 4-Bit S-Boxes and Finite Field Multiplication
1 Introduction and Motivation
2 Definitions and Notations
3 New Construction
4 Generating 8-Bit Permutations from Smaller Ones and Finite Field Multiplication
5 A Discussion with Respect to Some Recent Methods
6 Practical Results
7 Conclusion and Future Work
References
XHX - A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing
1 Introduction
2 Preliminaries
3 The Generic GXHX Construction
4 XHX: Deriving the Hash Keys from the Block Cipher
4.1 Security Proof of XHX
5 Efficient Instantiations
References
Improved XKX-Based AEAD Scheme: Removing the Birthday Terms
1 Introduction
2 Preliminaries
2.1 Notations
2.2 Definitions of (Tweakable) Blockciphers
2.3 Definition of Pseudo-Random Function
2.4 Definition of Nonce-Based Authenticated Encryption with Associated Data
2.5 Definition of Almost XOR Universal Hash Function
3 XK and XKX DBLP:journalsspstoscspsNaito17
3.1 Specification
3.2 Security of XKX
3.3 XKX-Based AEAD Schemes
4 Our Result: Improved Security Bound of XKX-Based nAEAD Scheme
4.1 Specification of XKX-Based CB3
4.2 Security Bounds of CB3
4.3 Proof of Theorem 2
4.4 Proof of Theorem 3
5 BC-Based Instantiations
6 Conclusion
References
Multiparty Computation and Privacy
Aggregation of Time-Series Data Under Differential Privacy
1 Introduction
2 Preliminaries
2.1 Model
2.2 Cryptographic Hardness Assumptions and Pseudo-random Functions
2.3 Private Stream Aggregation
2.4 Differential Privacy
3 Feasibility of AO1
3.1 Security Proof
4 The Constructions
4.1 A DDH-Based PSA Scheme
4.2 A DLWE-Based PSA Scheme
5 Conclusion
References
The Oblivious Machine
1 Introduction
1.1 Our Contribution
1.2 Related Work
2 From Oblivious Arrays to Oblivious Computation
3 Our Implementation
3.1 Compilation
4 Efficient Private Regular Expression Matching with Minimal Leakage
4.1 Complexity
4.2 Security
5 Experiments
5.1 Comparison to Non-oblivious Computation
5.2 Comparison with Wang et al.'s Secure MIPS Computation
5.3 Regular Expression Matching
6 Conclusion and Future Directions
References
Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority
1 Introduction
2 Preliminaries
3 Optimizations for BGW Based Sub-Protocols
3.1 Reducing the Computational Complexity
3.2 Further Optimizations
3.3 The Optimized Protocol
3.4 Security
4 Protocol for the Malicious Model
4.1 Protocol Description
5 Experimental Results
References
New Constructions
Homomorphic Rank Sort Using Surrogate Polynomials
1 Introduction
2 Background
2.1 Batching and Rotation of the Message Slots
2.2 Problem Definition and Existing Algorithms
3 Our Proposal: Polynomial Rank Sort
3.1 Finding Rank Monomials
3.2 Finding Rank Monomials in the Encrypted Domain
3.3 Comparison with the Previous Methods
4 Batching Input Elements
4.1 Choosing m and d
5 Conclusion
References
On Trees, Chains and Fast Transactions in the Blockchain
1 Introduction
2 Preliminaries and the GHOST Backbone protocol
2.1 Model
2.2 The GHOST Backbone Protocol
2.3 Security Properties
3 A Unified Description of Bitcoin and GHOST Backbone
4 Security Analysis and Applications
4.1 The Fresh Block Lemma
4.2 A Robust Public Transaction Ledger
A Probability of Uniquely Successful Rounds
B Proofs
B.1 Proof of Lemma 3
B.2 Proof of Lemma 4
References
Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security
1 Introduction
1.1 Our Contribution
1.2 Our Solution in a Nutshell
1.3 Improvements to the Proof of ggn16
1.4 Results of Implementation
1.5 Motivation: Bitcoin Wallet Security
2 Model, Definitions and Tools
2.1 Level-1 Homomorphic Encryption
2.2 Threshold Cryptosystems
2.3 Non-malleable Trapdoor Commitments
2.4 Independent Trapdoor Commitments
2.5 Candidate Non-malleable/Independent Trapdoor Commitments
3 The New Scheme
3.1 Signature Generation
4 Security Proof
4.1 Signature Generation Simulation
4.2 Concrete Analysis
5 Implementation Report
References
Adversarial Cryptography
Environmental Authentication in Malware
1 Introduction
1.1 Other Related Work
2 Definitions
2.1 Modeling Computer Systems
3 Blind Scenario
4 Basic Scenario
5 Resettable Adversary
A Proofs
A.1 Proof of Theorem 2
A.2 Proof of Theorem 3
A.3 Proof of Theorem 4
A.4 Proof of Theorem 5
References
Threshold Kleptographic Attacks on Discrete Logarithm Based Signatures
1 Introduction
2 Preliminaries
2.1 Diffie-Hellman Assumptions
2.2 Definitions and Security Models
2.3 Generalized ElGamal Signature
2.4 Young-Yung SETUP Attack on the Generalized ElGamal Signature
3 Multiplicative ElGamal Encryption
3.1 Scheme Description
3.2 Security Analysis
4 A SETUP Attack on the Generalized ElGamal Signature
5 A Threshold SETUP Attack on the Generalized ElGamal Signature
6 Conclusions
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Progress in Cryptology - LATINCRYPT 2017

Description

More details

Other editions

Additional editions

Content

System requirements