Round and Communication Efficient Unconditionally-secure MPC with t<n/3 in Partially Synchronous Network
Ashish Choudhury (International Institute of Information Technology Bangalore, India), Arpita Patra, and Divya Ravi (Indian Institute of Science, Bangalore, India)
Contrast Optimal XOR Based Visual Cryptographic Schemes
Sabyasachi Dutta (Indian Statistical Institute, India), and Avishek Adhikari (University of Calcutta, India)
Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free Public Communication
Go Kato (NTT Corporation, Japan), Masaki Owari (Shizuoka University, Japan), and Masahito Hayashi (Nagoya University, Japan, and National University of Singapore, Singapore)
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Ronald Cramer (CWI Amsterdam and Leiden University, The Netherlands), Ivan Damgård (Aarhus University, Denmark), Nico Döttling (Friedrich-Alexander-University Erlangen-Nürnberg, Germany), Irene Giacomelli (University of Wisconsin-Madison, USA), and Chaoping Xing (Nanyang Technological University, Singapore)
Renyi Resolvability and Its Applications to the Wiretap Channel
Lei Yu, and Vincent Y. F. Tan (National University of Singapore, Singapore)
Secure Network Coding for Multiple Unicast: On the Case of Single Source
Gaurav Kumar Agarwal, Martina Cardone, Christina Fragouli (University of California Los Angeles, USA)
Secure Grouping Protocol Using a Deck of Cards
Yuji Hashimoto (Tokyo Denki University, and National Institute of Advanced Industrial Science and Technology, Japan), Kazumasa Shinagawa (Tokyo Institute of Technology, and National Institute of Advanced Industrial Science and Technology, Japan), Koji Nuida (National Institute of Advanced Industrial Science and Technology, Japan), Masaki Inamura (Tokyo Denki University, Japan), Goichiro Hanaoka (National Institute of Advanced Industrial Science and Technology, Japan)
Catching MPC Cheaters: Identification and Openability
Robert Cunningham (Massachusetts Institute of Technology, USA), Benjamin Fuller (University of Connecticut, USA), and Sophia Yakoubov (Massachusetts Institute of Technology, USA)
Disproving the Conjectures from "On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model"
Daniel Malinowski, and Karol Żebrowski (University of Warsaw, Poland)
Broadcast Encryption with Guessing Secrecy
Yohei Watanabe (The University of Electro-Communications, and National Institute of Advanced Industrial Science and Technology, Japan)
Four Cards Are Sufficient for Card-based Three-Input Voting Protocol Utilizing Private Permutations
Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto, and Kazuo Ohta (The University of Electro-Communications, Japan)
Verifiably Multiplicative Secret Sharing
Maki Yoshida (NICT, Japan), and Satoshi Obana (Hosei University, Japan)
Workshop Track
On Secure Asymmetric Multilevel Diversity Coding Systems
Congduan Li (City University of Hong Kong, Hong Kong), Xuan Guang (The Chinese University of Hong Kong, Hong Kong), Chee Wei Tan (City University of Hong Kong, Hong Kong), and Raymond W. Yeung (The Chinese University of Hong Kong, Hong Kong)
Computing on Quantum Shared Secrets
Yingkai Ouyang, Si-Hui Tan, Liming Zhao, and Joseph Fitzsimons (Singapore University of Technology and Design, and Centre of Quantum Technologies, Singapore)
Information-theoretic Physical Layer Security for Satellite Channels
Angeles Vazquez-Castro (Autonomous University of Barcelona, Spain), and Masahito Hayashi (Nagoya University, Japan, and National University of Singapore, Singapore)
Secure Wireless Communication under Spatial and Local Gaussian Noise Assumptions
Masahito Hayashi (Nagoya University, Japan, and National University of Singapore, Singapore)
Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution
Masahito Hayashi (Nagoya University, Japan, and National University of Singapore, Singapore), Masaki Owari (Shizuoka University, Japan), Go Kato (NTT Corporation, Japan), and Ning Cai (ShanghaiTech University, China)
Worst-Case Guessing Secrecy Is Meaningful in Secret Sharing Schemes
Mitsugu Iwamoto (The University of Electro-Communications, Japan)
Compressed Secret Key Agreement
Chung Chan (The Chinese University of Hong Kong, Hong Kong)