In Cooperation With
Tighter Bounds for the Oblivious Bit-Fixing Inner Product Extractor on Biased Seeds
Jack Doerner, Lawrence Roy
Limits on the Power of Private Constrained PRFs
Mengda Bi, Yaohua Ma, Chenxin Dai
Interactive Proofs for Batch Polynomial Evaluation
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
Fiat-Shamir for Bounded-Depth Adversaries
Liyan Chen, Yilei Chen, Zikuan Huang, Nuozhou Sun, Tianqi Yang, Yiding Zhang
Weak Zero-Knowledge and One-Way Functions
Rohit Chatterjee, Yunqi Li, Prashant Nalini Vasudevan
Towards Characterizing Secure Samplability
Hari Krishnan P. Anilkumar, Keval Jain, Manoj Prabhakaran, Vinod M. Prabhakaran
Compressing Correlations via Secret Replication: PCFs from Symmetric Cryptography
Yuval Ishai, Hugo Krawczyk, Tal Rabin
Fast Bounded-Independence Functions and Their Duals
Martijn Brehm, Yuval Ishai, Nicolas Resch
Resilience of Inner-Product Masking Scheme against Hamming Weight Leakage
Aniruddha Biswas, Jihun Hwang, Hemanta K. Maji, Xiuyu Ye
Partial Derandomization for Leakage-Resilient Shamir’s Secret Sharing over Composite Order Fields
S. Venkitesh
When Does Quantum Differential Privacy Compose?
Daniel Alabi, Theshani Nuradha
Adaptive Garbled Circuits and Garbled RAM from Non-Programmable Random Oracles
Cruz Barnum, David Heath, Vladimir Kolesnikov, Rafail Ostrovsky