Advances in Cryptology – CRYPTO 2021

41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV

AvTal Malkin,Chris Peikert

Häftad, Engelska, 2021

Del 12828 i serien Lecture Notes in Computer Science

1 202 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

The four-volume set, LNCS 12825, LNCS 12826, LNCS 12827, and LNCS 12828, constitutes the refereed proceedings of the 41st Annual International Cryptology Conference, CRYPTO 2021.

Produktinformation

Utgivningsdatum:2021-08-08
Mått:155 x 235 x 40 mm
Vikt:1 112 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:732
Förlag:Springer Nature Switzerland AG
ISBN:9783030842581

Utforska kategorier

Referensverk och tvärvetenskap inom Samhälle och politik
Nätverk och kommunikation inom Data och IT
IT-säkerhet inom Data och IT

Innehållsförteckning

Zero Knowledge.- Witness Authenticating NIZKs and Applications.- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs.- Compressing Proofs of k-Out-Of-n Partial Knowledge.- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.- Time- and Space-Efficient Arguments from Groups of Unknown Order.- Encryption++.- Broadcast Encryption with Size N1/3 and More from k-Lin.- Fine-grained Secure Attribute-based Encryption.- Multi-Input Quadratic Functional Encryption from Pairings.- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE.- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved.- Foundations.- White Box Traitor Tracing.- Does Fiat-Shamir Require a Cryptographic Hash Function?.- Composition with Knowledge Assumptions.- Non-Interactive Batch Arguments for NP from Standard Assumptions.- Targeted Lossy Functions and Applications.- The t-wise Independence of Substitution-Permutation Networks.- Low-Complexity Cryptography.- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2].- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications.- No Time to Hash: On Super-Efficient Entropy Accumulation.- Protocols.- A Logarithmic Lower Bound for Oblivious RAM (for all parameters).- Oblivious RAM with Worst-Case Logarithmic Overhead.- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time.- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model.- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange.