Byzantine Fault-Tolerance with Commutative Commands. - Pavel Raykov; Nicolas Schiper; Fernando Pedone (OPODIS, 2011)

Broadcast (and Round) Efficient Verifiable Secret Sharing. - Juan A. Garay; Clint Givens; Rafail Ostrovsky; Pavel Raykov (ICITS, 2013)

Broadcast Amplification. - Martin Hirt; Ueli Maurer; Pavel Raykov (IACR Cryptol. ePrint Arch., 2013)

On the Complexity of Broadcast Setup. - Martin Hirt; Pavel Raykov (IACR Cryptol. ePrint Arch., 2013)

Multi-Valued Byzantine Broadcast: the t<n Case. - Martin Hirt; Pavel Raykov (IACR Cryptol. ePrint Arch., 2013)

Fast and unconditionally secure anonymous channel. - Juan A. Garay; Clinton Givens; Rafail Ostrovsky; Pavel Raykov (PODC, 2014)

Anonymous Authentication with Shared Secrets. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (IACR Cryptol. ePrint Arch., 2014)

Key-Indistinguishable Message Authentication Codes. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (IACR Cryptol. ePrint Arch., 2014)

From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. - Benny Applebaum; Pavel Raykov (Electron. Colloquium Comput. Complex., 2015)

Broadcast from Minicast Secure Against General Adversaries. - Pavel Raykov (IACR Cryptol. ePrint Arch., 2015)

Fast Pseudorandom Functions Based on Expander Graphs. - Benny Applebaum; Pavel Raykov (Electron. Colloquium Comput. Complex., 2016)

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. - Benny Applebaum; Pavel Raykov (Comput. Complex., 2019)

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. - Benny Applebaum; Barak Arkis; Pavel Raykov; Prashant Nalini Vasudevan (SIAM J. Comput., 2021)

An Optimal Algorithm for Sliding Window Order Statistics. - Pavel Raykov (ICDT, 2023)