Nissim / Waters | Theory of Cryptography | E-Book | sack.de
E-Book

E-Book, Englisch, Band 13042, 785 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Nissim / Waters Theory of Cryptography

19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part I
1. Auflage 2021
ISBN: 978-3-030-90459-3
Verlag: Springer International Publishing
Format: PDF
 Kopierschutz: 1 - PDF Watermark

19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part I

E-Book, Englisch, Band 13042, 785 Seiten, eBook

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-030-90459-3
Verlag: Springer International Publishing
Format: PDF
 Kopierschutz: 1 - PDF Watermark

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.
Nissim / Waters Theory of Cryptography jetzt bestellen!

Zielgruppe

Research

Autoren/Hrsg.

Nissim, Kobbi
Waters, Brent

Weitere Infos & Material

Secure Quantum Computation with Classical Communication.- Secure Software Leasing from Standard Assumptions.- Post-quantum Resettably-Sound Zero Knowledge.- Secure Software Leasing Without Assumptions.- The Round Complexity of Quantum Zero-Knowledge.- Rate-1 Quantum Fully Homomorphic Encryption.- Unifying Presampling via Concentration Bounds.- Quantum Key-length Extension.- Relationships between quantum IND-CPA notions.- Classical Binding for Quantum Commitments.- Unclonable Encryption, Revisited.- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs.- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness.- Tight Security Bounds for Micali's SNARGs.- Acyclicity Programming for Sigma-Protocols.-Statistical ZAPs from Group-Based Assumptions.- Generalized Proofs of Knowledge with Fully Dynamic Setup.- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions.- On expected polynomial runtime in cryptography.-Information-Theoretically Secure MPC against Mixed Dynamic Adversaries.- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback.- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.- Adaptive Security of Multi-Party Protocols, Revisited.-On Actively-Secure Elementary MPC Reductions.- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.-

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.