Practical Sharing of Quantum Secrets over Untrusted Channels -- Generalizing Efficient Multiparty Computation -- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity -- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits -- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy -- On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation -- Metric Pseudoentropy: Characterizations, Transformations and Applications -- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy -- Gambling, Computational Information and Encryption Security -- Query-Complexity Amplification for Random Oracles -- The Chaining Lemma and Its Application -- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens -- Limited View Adversary Codes: Bounds, Constructions and Applications -- Locally Decodable Codes for Edit Distance -- The Multivariate Hidden Number Problem -- Lattice Point Enumeration on Block Reduced Bases -- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes.