Abstract is missing.
- Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering ModelRonald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing. 1-25 [doi]
- Disproving the Conjectures from "On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model"Daniel Malinowski, Karol Zebrowski. 26-38 [doi]
- Broadcast Encryption with Guessing SecrecyYohei Watanabe. 39-57 [doi]
- Contrast Optimal XOR Based Visual Cryptographic SchemesSabyasachi Dutta, Avishek Adhikari. 58-72 [doi]
- Verifiably Multiplicative Secret SharingMaki Yoshida, Satoshi Obana. 73-82 [doi]
- Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous NetworkAshish Choudhury, Arpita Patra, Divya Ravi. 83-109 [doi]
- Catching MPC Cheaters: Identification and OpenabilityRobert Cunningham, Benjamin Fuller, Sophia Yakoubov. 110-134 [doi]
- Secure Grouping Protocol Using a Deck of CardsYuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka. 135-152 [doi]
- Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private PermutationsTakeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto, Kazuo Ohta. 153-165 [doi]
- Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free Public CommunicationGo Kato, Masaki Owari, Masahito Hayashi. 166-187 [doi]
- Secure Network Coding for Multiple Unicast: On the Case of Single SourceGaurav Kumar Agarwal, Martina Cardone, Christina Fragouli. 188-207 [doi]
- Rényi Resolvability and Its Applications to the Wiretap ChannelLei Yu, Vincent Y. F. Tan. 208-233 [doi]