Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Advances in Cryptology – CRYPTO 2019
The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections: Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse. Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations. Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.
Public-Key Cryptography – PKC 2020
The two-volume set LNCS 12110 and 12111 constitutes the refereed proceedings of the 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, PKC 2020, held in Edinburgh, UK, in May 2020. The 44 full papers presented were carefully reviewed and selected from 180 submissions. They are organized in topical sections such as: functional encryption; identity-based encryption; obfuscation and applications; encryption schemes; secure channels; basic primitives with special properties; proofs and arguments; lattice-based cryptography; isogeny-based cryptography; multiparty protocols; secure computation and related primitives; post-quantum primitives; and privacy-preserving schemes.
Fundamentals of Computation Theory
This book constitutes the proceedings of the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, held in Trier, Germany, in September 2023. The __ full papers included in this volume were carefully reviewed and selected from __ submissions. In addition, the book contains ____ invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Computing and Combinatorics
This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi’an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.
Advances in Information and Computer Security
This book constitutes the proceedings of the 10th International Workshop on Security, IWSEC 2015, held in Nara, Japan, in August 2015. The 18 full papers and 3 short papers presented in this volume were carefully reviewed and selected from 58 submissions. They were organized in topical sections named: identity-based encryption; elliptic curve cryptography; factoring; symmetric cryptanalysis; provable security; LWE-based encryption; privacy-preserving and anonymity; secure protocol; systems security; and security in hardware.
Algorithms and Computation
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India, December 2006. The 73 revised full papers cover algorithms and data structures, online algorithms, approximation algorithm, computational geometry, computational complexity, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
Algorithms and Computation
This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Computation, ISAAC 2001, held in Christchurch, New Zealand in December 2001. The 62 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 124 submissions. The papers are organized in topical sections on combinatorial generation and optimization, parallel and distributed algorithms, graph drawing and algorithms, computational geometry, computational complexity and cryptology, automata and formal languages, computational biology and string matching, and algorithms and data structures.
Theory and Applications of Models of Computation
TAMC 2006 was the third conference in the series. The previous two meetings were held May 17–19, 2004 in Beijing, and May 17–20, 2005 in Kunming
Cryptology and Network Security
This book constitutes the refereed proceedings of the 22nd International Conference on Cryptology and Network Security, CANS 2023, which was held in October/November 2023 in Augusta, GA, USA. The 25 papers presented were thoroughly revised and selected from the 54 submissions. They are organized in the following topical sections: Schemes I; Basic Primitives; Security; MPC with Cards; Blockchain; MPC and Secret Sharing; Schemes II.
WALCOM: Algorithms and Computation
This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverseareas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.
