Description
Book SynopsisSecure Computation: Single-Input Functionality against a Dishonest Majority: Practical and Round-Optimal.- Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.- Effcient Permutation Correlations and Batched Random Access for Two-Party Computation.- Π: A Unified Framework for Computational Verifiable Secret Sharing. Security against Real-World Attacks: Intermundium-DL: Assessing the Resilience of Current Schemes to Discrete-Log-Computation Attacks on Public Parameters.- Public-Algorithm Substitution Attacks: Subverting Hashing and Verification.- Kleptographic Attacks against Implicit Rejection.- Deny Whatever You Want: Dual-Deniable Public-Key Encryption. Batch Arguments and Decentralized Encryption: Monotone-Policy BARGs and More from BARGs and Quadratic Residuosity.- Chosen Ciphertext Security via BARGs.- Dynamic Decentralized Functional Encryption: Generic Constructions with Strong Security.- Dynamic Decentralized Functional Encryptions from Pairings in the Standard Model.
