Angelos Pelecanos

According to our database, Angelos Pelecanos authored at least 8 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

More Efficient Approximate <i>k</i>-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities.

Lucas Gretta, William He, Angelos Pelecanos

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

How Fast Does the Inverse Walk Approximate a Random Permutation?

Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan

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

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

More Efficient <i>k</i>-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities.

Lucas Gretta, William He, Angelos Pelecanos

CoRR, 2024

Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.

Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

On the Computational Hardness of Quantum One-Wayness.

Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos

CoRR, 2023

Classical vs Quantum Advice under Classically-Accessible Oracle.

Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa

CoRR, 2023