Sourav Das

Orcid: 0000-0001-5298-621X

Affiliations:
  • University of Illinois at Urbana Champaign, Siebel School of Computing and Data Science, Champaign, IL, USA
  • Indian Institute of Technology Delhi, India (2014 - 2018)


According to our database1, Sourav Das authored at least 28 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distributed Randomness using Weighted VRFs.
IACR Cryptol. ePrint Arch., 2024

Asynchronous Consensus without Trusted Setup or Public-Key Cryptography.
IACR Cryptol. ePrint Arch., 2024

Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security.
IACR Cryptol. ePrint Arch., 2024

The Latency Price of Threshold Cryptosystem in Blockchains.
CoRR, 2024

Shoal++: High Throughput DAG BFT Can Be Fast!
CoRR, 2024

2023
On the Security of KZG Commitment for VSS.
IACR Cryptol. ePrint Arch., 2023

A New Paradigm for Verifiable Secret Sharing.
IACR Cryptol. ePrint Arch., 2023

Adaptively Secure BLS Threshold Signatures from DDH and co-CDH.
IACR Cryptol. ePrint Arch., 2023

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold.
IACR Cryptol. ePrint Arch., 2023

Distributed-Prover Interactive Proofs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Practical Asynchronous Proactive Secret Sharing and Key Refresh.
IACR Cryptol. ePrint Arch., 2022

Powers of Tau in Asynchrony.
IACR Cryptol. ePrint Arch., 2022

Balanced Quadratic Reliable Broadcast and Improved Asynchronous Verifiable Information Dispersal.
IACR Cryptol. ePrint Arch., 2022

Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling.
IACR Cryptol. ePrint Arch., 2022

Secret-Shared Joins with Multiplicity from Aggregation Trees.
IACR Cryptol. ePrint Arch., 2022

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation.
IACR Cryptol. ePrint Arch., 2022

Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.
IACR Cryptol. ePrint Arch., 2022

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

PAC Mode Estimation using PPR Martingale Confidence Sequences.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Tuxedo: Maximizing Smart Contract Computation in PoW Blockchains.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Practical Asynchronous Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2021

Asynchronous Data Dissemination and its Applications.
IACR Cryptol. ePrint Arch., 2021

SPURT: Scalable Distributed Randomness Beacon with Transparent Setup.
IACR Cryptol. ePrint Arch., 2021

RENOIR: Accelerating Blockchain Validation using State Caching.
Proceedings of the ICPE '21: ACM/SPEC International Conference on Performance Engineering, 2021

2020
Efficient Cross-Shard Transaction Execution in Sharded Blockchains.
CoRR, 2020

Better Late than Never; Scaling Computation in Blockchains by Delaying Execution.
CoRR, 2020

Airmed: Efficient Self-Healing Network of Low-End Devices.
CoRR, 2020

2019
YODA: Enabling computationally intensive contracts on blockchains with Byzantine and Selfish nodes.
Proceedings of the 26th Annual Network and Distributed System Security Symposium, 2019


  Loading...