Abstract is missing.
- The NISQ Complexity of Collision FindingYassine Hamoudi, Qipeng Liu 0001, Makrand Sinha. 3-32 [doi]
- Non-malleable Codes with Optimal Rate for Poly-Size CircuitsMarshall Ball, Ronen Shaltiel, Jad Silbak. 33-54 [doi]
- Approximate Lower Bound ArgumentsPyrros Chaidos, Aggelos Kiayias, Leonid Reyzin, Anatoliy Zinovyev. 55-84 [doi]
- Software with Certified DeletionJames Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Justin Raizes, Bhaskar Roberts. 85-111 [doi]
- Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-ResistanceCody Freitag, Omer Paneth, Rafael Pass. 112-141 [doi]
- Unbiasable Verifiable Random FunctionsEmanuele Giunta, Alistair Stewart. 142-167 [doi]
- Monotone-Policy Aggregate SignaturesMaya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain 0002, Omer Paneth. 168-195 [doi]
- Leakage-Tolerant CircuitsYuval Ishai, Yifan Song. 196-225 [doi]
- Pseudorandom IsometriesPrabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, Yao-Ting Lin. 226-254 [doi]
- New Limits of Provable Security and Applications to ElGamal EncryptionSven Schäge. 255-285 [doi]
- Constructing Leakage-Resilient Shamir's Secret Sharing: Over Composite Order FieldsHemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Xiuyu Ye. 286-315 [doi]
- Connecting Leakage-Resilient Secret Sharing to Practice: Scaling Trends and Physical Dependencies of Prime Field MaskingSebastian Faust, Loïc Masure, Elena Micheli, Maximilian Orlt, François-Xavier Standaert. 316-344 [doi]
- From Random Probing to Noisy Leakages Without Field-Size DependenceGianluca Brian, Stefan Dziembowski, Sebastian Faust. 345-374 [doi]
- A Direct PRF Construction from Kolmogorov ComplexityYanyi Liu, Rafael Pass. 375-406 [doi]