Classical vs Quantum Advice under Classically-Accessible Oracle. - Xingjian Li 006; Qipeng Liu 001; Angelos Pelecanos; Takashi Yamakawa (CoRR, 2023)

Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle. - Xingjian Li 006; Qipeng Liu 001; Angelos Pelecanos; Takashi Yamakawa (ITCS, 2024)

More Efficient k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. - Lucas Gretta; William He; Angelos Pelecanos (CoRR, 2024)

More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. - Lucas Gretta; William He; Angelos Pelecanos (IACR Cryptol. ePrint Arch., 2024)

Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers. - Tianren Liu; Angelos Pelecanos; Stefano Tessaro; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2024)

How Fast Does the Inverse Walk Approximate a Random Permutation? - Tianren Liu; Angelos Pelecanos; Stefano Tessaro; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2024)

More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities. - Lucas Gretta; William He; Angelos Pelecanos (SODA, 2025)

On the Computational Hardness of Quantum One-Wayness. - Bruno Cavalar; Eli Goldin; Matthew Gray; Peter Hall; Yanyi Liu; Angelos Pelecanos (Quantum, 2025)

Beating full state tomography for unentangled spectrum estimation. - Angelos Pelecanos; Xinyu Tan; Ewin Tang; John Wright (CoRR, 2025)