The following pages link to Pavel Raykov (Q1675750):
Displayed 15 items.
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations (Q1675751) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back (Q2799090) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Key-Indistinguishable Message Authentication Codes (Q2922676) (← links)
- Multi-valued Byzantine Broadcast: The t < n Case (Q2936623) (← links)
- Fast and unconditionally secure anonymous channel (Q2943631) (← links)
- Anonymous Authentication with Shared Secrets (Q2946477) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- On the Complexity of Broadcast Setup (Q5326591) (← links)
- Broadcast Amplification (Q5746347) (← links)