Public-Key Cryptography - PKC 2022

25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I
Herausgegeben:Hanaoka, Goichiro; Shikata, Junji; Watanabe, Yohei

• Broschiertes Buch

Produktbeschreibung

The two-volume proceedings set LNCS 13177 and 13178 constitutes the refereed proceedings of the 25th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2022, which took place virtually during March 7-11, 2022. The conference was originally planned to take place in Yokohama, Japan, but had to change to an online format due to the COVID-19 pandemic.

The 40 papers included in these proceedings were carefully reviewed and selected from 137 submissions. They focus on all aspects of public-key cryptography, covering cryptanalysis; MPC and secret sharing; cryptographic protocols; tools; SNARKs and NIZKs; key exchange; theory; encryption; and signatures.

Produktdetails

• Lecture Notes in Computer Science 13177
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-030-97120-5
• 1st ed. 2022
• Seitenzahl: 664
• Erscheinungstermin: 27. Februar 2022
• Englisch
• Abmessung: 235mm x 155mm x 36mm
• Gewicht: 990g
• ISBN-13: 9783030971205
• ISBN-10: 3030971201
• Artikelnr.: 63325132

Inhaltsangabe

Cryptanalysis.- Multitarget decryption failure attacks and their application to Saber and Kyber.- Post-quantum Security of Plain OAEP Transform.- On the security of OSIDH.- Time-Memory tradeoffs for large-weight syndrome decoding in ternary codes.- Syndrome Decoding Estimator.- On the Isogeny Problem with Torsion Point Information.- MPC and Secret Sharing.- Reusable Two-Round MPC from LPN.- On the Bottleneck Complexity of MPC with Correlated Randomness.- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN.- Fast Batched DPSS and its Applications.- CNF-FSS and its Applications.- Cryptographic Protocols.- Effcient Verifiable Partially-Decryptable Commitments from Lattices and Applications.- Making Private Function Evaluation Safer, Faster, and Simpler.- Two-Round Oblivious Linear Evaluation from Learning with Errors.- Improved Constructions of Anonymous Credentials From StructurePreserving Signatures on Equivalence Classes.- Traceable PRFs: Full Collusion Resistance andActive Security.- Tools.- Radical Isogenies on Montgomery Curves.- Towards a Simpler Lattice Gadget Toolkit.- SNARKs and NIZKs.- Polynomial IOPs for Linear Algebra Relations.- A Unified Framework for Non-Universal SNARKs.- ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines.- Rational Modular Encoding in the DCR Setting: Non-Interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model.