The following pages link to Prashant Nalini Vasudevan (Q776008):
Displaying 16 items.
- From laconic zero-knowledge to public-key cryptography. Extended abstract (Q776009) (← links)
- Multi-collision resistant hash functions and their applications (Q1648825) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations (Q1675751) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Tight verifiable delay functions (Q2106631) (← links)
- Formalizing data deletion in the context of the right to be forgotten (Q2119018) (← links)
- Batch verification for statistical zero knowledge proofs (Q2119042) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- Leakage resilient secret sharing and applications (Q2304991) (← links)
- Secret Sharing and Statistical Zero Knowledge (Q2811150) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- (Q5090374) (← links)
- Cryptography from Information Loss. (Q5875788) (← links)
- Collision Resistance from Multi-collision Resistance (Q6489330) (← links)
