| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910637738003321 |
|
|
Titolo |
Theory of Cryptography : 20th International Conference, TCC 2022, Chicago, IL, USA, November 7–10, 2022, Proceedings, Part III / / edited by Eike Kiltz, Vinod Vaikuntanathan |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2022.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (254 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 13749 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
|
|
Soggetti |
|
Cryptography |
Data encryption (Computer science) |
Computer networks |
Information storage and retrieval systems |
Application software |
Data protection |
Computer networks - Security measures |
Cryptology |
Computer Communication Networks |
Information Storage and Retrieval |
Computer and Information Systems Applications |
Security Services |
Mobile and Network Security |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Verifiable Private Information Retrieval -- Random-Index Oblivious RAM -- On the Optimal Communication Complexity of Error-Correcting Multi-Server PIR -- Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions -- One-Time Programs from Commodity Hardware -- Universal Reductions: Reductions Relative to Stateful Oracles -- Permissionless Clock Synchronization with Public Setup -- Beyond Uber: Instantiating Generic Groups via PGGs. . |
|
|
|
|
|
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
The three-volume set LNCS 13747, LNCS 13748 and LNCS 13749 constitutes the refereed proceedings of the 20th International Conference on Theory of Cryptography, TCC 2022, held in Chicago, IL, USA, in November 2022. The total of 60 full papers presented in this three-volume set was carefully reviewed and selected from 139 submissions. They cover topics on post-quantum cryptography; interactive proofs; quantum cryptography; secret-sharing and applications; succinct proofs; identity-based encryption and functional encryption; attribute-based encryption and functional encryption; encryption; multi-party computation; protocols: key agreement and commitments; theory: sampling and friends; lattices; anonymity, verfiability and robustness; ORAM, OT and PIR; and theory. |
|
|
|
|
|
|
|
| |