default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Raykov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Pavel Raykov:
An Optimal Algorithm for Sliding Window Order Statistics. ICDT 2023: 5:1-5:13- 2021
- [j3]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. SIAM J. Comput. 50(1): 32-67 (2021)
2010 – 2019
- 2019
- [j2]Benny Applebaum, Pavel Raykov:
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. Comput. Complex. 28(4): 573-616 (2019) - 2017
- [j1]Benny Applebaum, Pavel Raykov:
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. J. Cryptol. 30(4): 961-988 (2017) - [c13]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. CRYPTO (1) 2017: 727-757 - [i14]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. Electron. Colloquium Comput. Complex. TR17 (2017) - [i13]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. IACR Cryptol. ePrint Arch. 2017: 164 (2017) - 2016
- [c12]Benny Applebaum, Pavel Raykov:
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. CRYPTO (3) 2016: 449-477 - [c11]Benny Applebaum, Pavel Raykov:
Fast Pseudorandom Functions Based on Expander Graphs. TCC (B1) 2016: 27-56 - [c10]Benny Applebaum, Pavel Raykov:
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. TCC (A2) 2016: 65-82 - [i12]Benny Applebaum, Pavel Raykov:
Fast Pseudorandom Functions Based on Expander Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i11]Benny Applebaum, Pavel Raykov:
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings. IACR Cryptol. ePrint Arch. 2016: 519 (2016) - [i10]Benny Applebaum, Pavel Raykov:
Fast Pseudorandom Functions Based on Expander Graphs. IACR Cryptol. ePrint Arch. 2016: 813 (2016) - 2015
- [c9]Pavel Raykov:
Broadcast from Minicast Secure Against General Adversaries. ICALP (2) 2015: 701-712 - [i9]Benny Applebaum, Pavel Raykov:
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings. Electron. Colloquium Comput. Complex. TR15 (2015) - [i8]Benny Applebaum, Pavel Raykov:
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. Electron. Colloquium Comput. Complex. TR15 (2015) - [i7]Pavel Raykov:
Broadcast from Minicast Secure Against General Adversaries. IACR Cryptol. ePrint Arch. 2015: 352 (2015) - [i6]Benny Applebaum, Pavel Raykov:
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. IACR Cryptol. ePrint Arch. 2015: 1046 (2015) - 2014
- [c8]Martin Hirt, Pavel Raykov:
Multi-valued Byzantine Broadcast: The t < n Case. ASIACRYPT (2) 2014: 448-465 - [c7]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. LATINCRYPT 2014: 219-236 - [c6]Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov:
Fast and unconditionally secure anonymous channel. PODC 2014: 313-321 - [c5]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. SCN 2014: 476-493 - [c4]Martin Hirt, Ueli Maurer, Pavel Raykov:
Broadcast Amplification. TCC 2014: 419-439 - [i5]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. IACR Cryptol. ePrint Arch. 2014: 73 (2014) - [i4]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. IACR Cryptol. ePrint Arch. 2014: 107 (2014) - 2013
- [c3]Martin Hirt, Pavel Raykov:
On the Complexity of Broadcast Setup. ICALP (1) 2013: 552-563 - [c2]Juan A. Garay, Clint Givens, Rafail Ostrovsky, Pavel Raykov:
Broadcast (and Round) Efficient Verifiable Secret Sharing. ICITS 2013: 200-219 - [i3]Martin Hirt, Pavel Raykov:
On the Complexity of Broadcast Setup. IACR Cryptol. ePrint Arch. 2013: 103 (2013) - [i2]Martin Hirt, Pavel Raykov:
Multi-Valued Byzantine Broadcast: the t<n Case. IACR Cryptol. ePrint Arch. 2013: 553 (2013) - [i1]Martin Hirt, Ueli Maurer, Pavel Raykov:
Broadcast Amplification. IACR Cryptol. ePrint Arch. 2013: 769 (2013) - 2011
- [c1]Pavel Raykov, Nicolas Schiper, Fernando Pedone
:
Byzantine Fault-Tolerance with Commutative Commands. OPODIS 2011: 329-342
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
