Invited Papers -- Abstract Models of Computation in Cryptography -- Pairing-Based Cryptography at High Security Levels -- Improved Decoding of Interleaved AG Codes -- Coding Theory -- Performance Improvement of Turbo Code Based on the Extrinsic Information Transition Characteristics -- A Trellis-Based Bound on (2,1)-Separating Codes -- Tessellation Based Multiple Description Coding -- Exploitin…
Efficient Distributed Computation Modulo a Shared Secret -- Multiparty Computation, an Introduction -- Foundations of Modern Cryptography -- Provable Security for Public Key Schemes -- Efficient and Secure Public-Key Cryptosystems.The aim of this text is to treat selected topics of the subject of contemporary cryptology, structured in five quite independent but related themes: - efficient distr…
Book Introduction -- Iterative Codes in Magnetic Storage Systems -- Turbo Product Codes for Optical Recording Systems -- Turbo and Turbo-like Code Design in ADSL Modems -- Turbo Codes for Single-Mode and Multimode Fiber Optic Communications -- Iterative Demodulation and Decoding -- Turbo Receiver Techniques for Coded MIMO OFDM Systems -- Space-Time Turbo Coded Modulation for Future Wireless Com…
Genesis and Theory of Computer Viruses -- The Formalization Foundations: from Turing to von Neumann (1936 – 1967) -- F. Cohen and L. Adleman’s Formalization (1984 – 1989) -- Taxonomy, Techniques and Tools -- Fighting Against Viruses -- Learning Computer Viruses by Programming -- Computer Viruses in Interpreted Programming Language -- Companion Viruses -- Worms -- Computer Viruses and Appl…
CMMI RAMS Extension Based on CENELEC Railway Standard -- The Importance of Single-Source Engineering of Emergency and Process Shutdown Systems -- Combining Extended UML Models and Formal Methods to Analyze Real-Time Systems -- Defining and Decomposing Safety Policy for Systems of Systems -- Generalising Event Trees Using Bayesian Networks with a Case Study of Train Derailment -- Control and Dat…
Cryptanalysis I -- Cryptanalysis of the Hash Functions MD4 and RIPEMD -- How to Break MD5 and Other Hash Functions -- Collisions of SHA-0 and Reduced SHA-1 -- Theory I -- Reducing Complexity Assumptions for Statistically-Hiding Commitment -- Smooth Projective Hashing and Two-Message Oblivious Transfer -- On Robust Combiners for Oblivious Transfer and Other Primitives -- Encryption I -- Efficien…
Efficient Collision Search Attacks on SHA-0 -- Finding Collisions in the Full SHA-1 -- Pebbling and Proofs of Work -- Composition Does Not Imply Adaptive Security -- On the Discrete Logarithm Problem on Algebraic Tori -- A Practical Attack on a Braid Group Based Cryptographic Protocol -- The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption -- Unconditional Characteriza…
Algebra and Number Theory -- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log -- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? -- Adapting Density Attacks to Low-Weight Knapsacks -- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains -- Multiparty Computation -- Upper Bounds on the Communication Complexity …
to Cryptocomplexity -- Foundations of Computer Science and Mathematics -- Foundations of Complexity Theory -- Foundations of Cryptology -- Hierarchies Based on NP -- Randomized Algorithms and Complexity Classes -- RSA Cryptosystem, Primality, and Factoring -- Other Public-Key Cryptosystems and Protocols.Modern cryptology employs mathematically rigorous concepts and methods from complexity theor…
Algorithmic Problems & Their Complexity -- Fundamental Complexity Classes -- Reductions — Algorithmic Relationships Between Problems -- The Theory of NP-Completeness -- NP-complete and NP-equivalent Problems -- The Complexity Analysis of Problems -- The Complexity of Approximation Problems — Classical Results -- The Complexity of Black Box Problems -- Additional Complexity Classes and Relat…