Amazon cover image
Image from Amazon.com

Theory of Cryptography [electronic resource] : 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /

Contributor(s): Material type: TextTextSeries: Security and Cryptology ; 13043Publisher: Cham : Springer International Publishing : Imprint: Springer, 2021Edition: 1st ed. 2021Description: XII, 753 p. 64 illus., 30 illus. in color. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783030904531
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.824 23
LOC classification:
  • QA268
Online resources:
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.-.
In: Springer Nature eBookSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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.-.

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.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in