3.4 Using Only the Binary Representations3.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
5 Secure Channels and Termination in TLS 1.25.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
5.2 Security of Our Generic Composition6 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
7.1 Authentication with Corrupted Users7.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
0
8
8
8
8
This book constitutes the refereed post-conference proceedings of the 5th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2017, held in Havana, Cuba, in September 2017. The 20 papers presented were carefully reviewed and selected from 64 submissions. They are organized in the following topical sections: security protocols; public-key implementation; cryptanalysis; theory of symmetric-key cryptography; multiparty computation and privacy; new constructions; and adversarial cryptography.