Muutke küpsiste eelistusi

Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 811, 2021, Proceedings, Part III 1st ed. 2021 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 515 pages, kõrgus x laius: 235x155 mm, kaal: 801 g, 15 Illustrations, color; 26 Illustrations, black and white; XII, 515 p. 41 illus., 15 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13044
  • Ilmumisaeg: 05-Nov-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030904555
  • ISBN-13: 9783030904555
  • Pehme köide
  • Hind: 95,02 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 111,79 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 515 pages, kõrgus x laius: 235x155 mm, kaal: 801 g, 15 Illustrations, color; 26 Illustrations, black and white; XII, 515 p. 41 illus., 15 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13044
  • Ilmumisaeg: 05-Nov-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030904555
  • ISBN-13: 9783030904555

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.

Covert Learning: How to Learn with an Untrusted Intermediary.- Random-Index PIR and Applications.- Forward Secret Encrypted RAM: Lower Bounds and Applications.- Laconic Private Set Intersection and Applications.- Amortizing Rate-1 OT and Applications to PIR and PSI.- Ring-based Identity Based Encryption { Asymptotically Shorter MPK and Tighter Security.- Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption.- Grafting Key Trees: Efficient Key Management for Overlapping Groups.- Updatable Public Key Encryption in the Standard Model.- Towards Tight Adaptive Security of Non-Interactive Key Exchange.- On the Impossibility of Purely Algebraic Signatures.- Policy-Compliant Signatures.- Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions.- Non-Malleable Vector Commitments via Local Equivocability.- Non-Malleable Time-Lock Puzzles and Applications.- Vector and Functional Commitments from Lattices.-