Abstract is missing.
- Account Management in Proof of Stake LedgersDimitris Karakostas, Aggelos Kiayias, Mario Larangeira. 3-23 [doi]
- Afgjort: A Partially Synchronous Finality Layer for BlockchainsThomas Dinsdale-Young, Bernardo Magri, Christian Matt 0002, Jesper Buus Nielsen, Daniel Tschudi. 24-44 [doi]
- Aggregatable Subvector Commitments for Stateless CryptocurrenciesAlin Tomescu, Ittai Abraham, Vitalik Buterin, Justin Drake, Dankrad Feist, Dmitry Khovratovich. 45-64 [doi]
- Tight Verifiable Delay FunctionsNico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan. 65-84 [doi]
- Black-Box Constructions of Bounded-Concurrent Secure ComputationSanjam Garg, Xiao Liang, Omkant Pandey, Ivan Visconti. 87-107 [doi]
- Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic GroupsKarim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung. 108-129 [doi]
- Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWECarsten Baum, Daniel Escudero 0001, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza. 130-149 [doi]
- Multi-clients Verifiable Computation via Conditional Disclosure of SecretsRishabh Bhadauria, Carmit Hazay. 150-171 [doi]
- Private Identity Agreement for Private Set FunctionalitiesBen Kreuter, Sarvar Patel, Ben Terner. 172-191 [doi]
- UC-Secure OT from LWE, RevisitedWilly Quach. 192-211 [doi]
- Efficient 3-Party Distributed ORAMPaul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky. 215-232 [doi]
- Gradual GRAM and Secure Computation for RAM ProgramsCarmit Hazay, Mor Lilintal. 233-252 [doi]
- Oblivious Tight Compaction In O(n) Time with Smaller ConstantSamuel Dittmer, Rafail Ostrovsky. 253-274 [doi]
- Anonymity and Rewards in Peer Rating SystemsLydia Garms, Siaw-Lynn Ng, Elizabeth A. Quaglia, Giulia Traverso. 277-297 [doi]
- Secure Generalized Deduplication via Multi-Key Revealing EncryptionDaniel E. Lucani, Lars Nielsen, Claudio Orlandi, Elena Pagnin, Rasmus Vestergaard. 298-318 [doi]
- A Simple and Efficient CCA-Secure Lattice KEM in the Standard ModelXavier Boyen, Malika Izabachène, Qinyi Li. 321-337 [doi]
- Double-Authentication-Preventing Signatures in the Standard ModelDario Catalano, Georg Fuchsbauer, Azam Soleimanian. 338-358 [doi]
- Efficient Signatures on Randomizable CiphertextsBalthazar Bauer, Georg Fuchsbauer. 359-381 [doi]
- Fast Threshold ECDSA with Honest MajorityIvan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergaard. 382-400 [doi]
- Short Threshold Dynamic Group SignaturesJan Camenisch, Manu Drijvers, Anja Lehmann, Gregory Neven, Patrick Towa. 401-423 [doi]
- Fully Collision-Resistant Chameleon-Hashes from Simpler and Post-quantum AssumptionsDavid Derler, Stephan Krenn, Kai Samelin, Daniel Slamanig. 427-447 [doi]
- Generalized Matsui Algorithm 1 with Application for the Full DESTomer Ashur, Raluca Posteuca, Danilo Sijacic, Stef D'haeseleer. 448-467 [doi]
- Anonymous Symmetric-Key CommunicationFabio Banfi, Ueli Maurer. 471-491 [doi]
- Cryptographic Divergences: New Techniques and New ApplicationsMarc Abboud, Thomas Prest. 492-511 [doi]
- Impossibility of Strong KDM Security with Auxiliary InputCody Freitag, Ilan Komargodski, Rafael Pass. 512-524 [doi]
- Multi-Client Inner-Product Functional Encryption in the Random-Oracle ModelMichel Abdalla, Florian Bourse, Hugo Marival, David Pointcheval, Azam Soleimanian, Hendrik Waldner. 525-545 [doi]
- On the Query Complexity of Constructing PRFs from Non-adaptive PRFsPratik Soni, Stefano Tessaro. 546-565 [doi]
- Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are LongKasper Green Larsen, Mark Simkin 0001. 566-578 [doi]
- Separating Symmetric and Asymmetric Password-Authenticated Key ExchangeJulia Hesse. 579-599 [doi]
- The Round Complexity of Secure Computation Against Covert AdversariesArka Rai Choudhuri, Vipul Goyal, Abhishek Jain 0002. 600-620 [doi]
- Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic LimitRafael Pass. 621-642 [doi]
- Key-and-Argument-Updatable QA-NIZKsHelger Lipmaa. 645-669 [doi]
- On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKsMichele Ciampi, Roberto Parisella, Daniele Venturi 0001. 670-690 [doi]