Progress in Cryptology - INDOCRYPT 2019

Constructions : Signatures and Filter Permutators.- PKP-Based Signature scheme.- Modification tolerant signature schemes: location and correction.- Rerandomizable Signatures under Standard Assumption.- Improved Filter Permutators for Efficient FHE: Better Instances and Implementations.- Cryptanalysis : Symmetric Key Ciphers and Hash Functions.- RC4: Non-Randomness in the index j and some results on its Cycles.- Automatic Tool for Searching for Differential Characteristics in ARX Ciphers and Applications.- Improved Related-Tweakey Rectangle Attacks on Reduced-round Deoxys-BC-384 and Deoxys-I-256-128.- Some cryptanalytic results on TRIAD.- Cryptanalysis of Round-Reduced KECCAK using Non-Linear Structures.- Protocols : Blockchain, Secure Computation and Blind Coupon Mechanism.- Nummatus : A Privacy Preserving Proof of Reserves Protocol for Quisquis.- Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation.- MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security.- A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks.- Theory: Oblivious Transfer, Obfuscation and Privacy Amplification.- UC Priced Oblivious Transfer with Purchase Statistics and Dynamic Pricing.- Public-coin Differing-inputs Obfuscator for Hiding-input Point Function with Multi-bit Output and Its Applications.- Privacy Amplification from Non-malleable Codes.- Mathematics : Boolean Functions, Elliptic Curves and Lattices.- Vectorial Boolean Functions with very Low Differential-linear Uniformity using Maiorana-McFarland type Construction.- On the Relationship between Resilient Boolean Functions and Linear Branch Number of S-boxes.- The complete cost of cofactor h=1.- Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction.- Quantum : Algorithms, Attacks and Key Distribution.- Efficient Quantum Algorithms related to Autocorrelation Spectrum.- Quantum Attacks against Type-1 Generalized Feistel Ciphers and