Angelos Pelecanos

13 papers A* 2A 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Beating full state tomography for unentangled spectrum estimation.
SODA
Angelos Pelecanos, Xinyu Tan, Ewin Tang, John Wright
2025 J jnl
Beating full state tomography for unentangled spectrum estimation.
CoRR
Angelos Pelecanos, Xinyu Tan, Ewin Tang, John Wright
2025 A* conf
More Efficient Approximate
SODA
Lucas Gretta, William He, Angelos Pelecanos
2025 J jnl
On the Computational Hardness of Quantum One-Wayness.
Quantum
Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos
2025 J jnl
When Simple Permutations Mix Poorly: Limited Independence Does Not Imply Pseudorandomness.
IACR Cryptol. ePrint Arch.
Jesko Dujmovic, Angelos Pelecanos, Stefano Tessaro
2024 A conf
Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.
ITCS
Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa
2024 J jnl
How Fast Does the Inverse Walk Approximate a Random Permutation?
IACR Cryptol. ePrint Arch.
Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan
2024 J jnl
Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers.
IACR Cryptol. ePrint Arch.
Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan
2024 J jnl
More Efficient
CoRR
Lucas Gretta, William He, Angelos Pelecanos
2024 J jnl
More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities.
IACR Cryptol. ePrint Arch.
Lucas Gretta, William He, Angelos Pelecanos
2023 J jnl
Classical vs Quantum Advice under Classically-Accessible Oracle.
CoRR
Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa
2023 — conf
Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers.
CRYPTO (3)
Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan
2023 J jnl
On the Computational Hardness of Quantum One-Wayness.
CoRR
Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos