1 option
Theory of Cryptography : 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part II / edited by Kobbi Nissim, Brent Waters.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Security and cryptology ; SL 4, 13043
- Security and Cryptology ; 13043
- Language:
- English
- Subjects (All):
- Cryptography.
- Data encryption (Computer science).
- Data structures (Computer science).
- Information theory.
- Computer engineering.
- Computer networks.
- Computer networks-Security measures.
- Cryptology.
- Data Structures and Information Theory.
- Computer Engineering and Networks.
- Mobile and Network Security.
- Local Subjects:
- Cryptology.
- Data Structures and Information Theory.
- Computer Engineering and Networks.
- Mobile and Network Security.
- Physical Description:
- 1 online resource (XII, 753 pages) : 64 illustrations, 30 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- The three-volume set LNCS 13042, LNCS 13043 and LNCS 13044 constitutes the refereed proceedings of the 19th International Conference on Theory of Cryptography, TCC 2021, held in Raleigh, NC, USA, in November 2021. The total of 66 full papers presented in this three-volume set was carefully reviewed and selected from 161 submissions. They cover topics on proof systems, attribute-based and functional encryption, obfuscation, key management and secure communication.
- Contents:
- 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.-.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-90453-1
- 9783030904531
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.