Theory of Cryptography
portes grátis
Theory of Cryptography
19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part II
Waters, Brent; Nissim, Kobbi
Springer Nature Switzerland AG
11/2021
753
Mole
Inglês
9783030904524
15 a 20 dias
1157
Descrição não disponível.
Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments.- On Communication-E cient Asynchronous MPC with Adaptive Security.- Efficient Perfectly Secure Computation with Optimal Resilience.- On Communication Models and Best-Achievable Security in Two-Round MPC.- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.- Blockchains Enable Non-Interactive MPC.- Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication.- Multi-Party Functional Encryption.- Succinct LWE Sampling, Random Polynomials, and Obfuscation.- ABE for DFA from LWE against Bounded Collusions, Revisited.- Distributed Merkle's Puzzles.- Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity.- Disappearing Cryptography in the Bounded Storage Model.- Trojan-Resilience without Cryptography.- On Derandomizing Yao's Weak-to-Strong OWF Construction.- Simple Constructions from (Almost) Regular One-Way Functions.- On Treewidth, Separators and Yao's Garbling.- Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.- The Cost of Adaptivity in Security Games on Graphs.- Concurrent Composition of Differential Privacy.- Direct Product Hardness Amplifcation.- On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger.- BKW Meets Fourier: New Algorithms for LPN with Sparse Parities.- Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy.- Polynomial-time targeted attacks on coin-tossing for any number of corruptions.-
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
communication systems;computer networks;computer security;computer systems;data security;information theory;mathematics;network protocols;network security;public key cryptography;signal processing;telecommunication systems;wireless telecommunication systems
Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments.- On Communication-E cient Asynchronous MPC with Adaptive Security.- Efficient Perfectly Secure Computation with Optimal Resilience.- On Communication Models and Best-Achievable Security in Two-Round MPC.- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.- Blockchains Enable Non-Interactive MPC.- Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication.- Multi-Party Functional Encryption.- Succinct LWE Sampling, Random Polynomials, and Obfuscation.- ABE for DFA from LWE against Bounded Collusions, Revisited.- Distributed Merkle's Puzzles.- Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity.- Disappearing Cryptography in the Bounded Storage Model.- Trojan-Resilience without Cryptography.- On Derandomizing Yao's Weak-to-Strong OWF Construction.- Simple Constructions from (Almost) Regular One-Way Functions.- On Treewidth, Separators and Yao's Garbling.- Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.- The Cost of Adaptivity in Security Games on Graphs.- Concurrent Composition of Differential Privacy.- Direct Product Hardness Amplifcation.- On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger.- BKW Meets Fourier: New Algorithms for LPN with Sparse Parities.- Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy.- Polynomial-time targeted attacks on coin-tossing for any number of corruptions.-
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
