Yashvanth Kondi

According to our database1, Yashvanth Kondi authored at least 16 papers between 2017 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions.
IACR Cryptol. ePrint Arch., 2023

Sometimes You Can't Distribute Random-Oracle-Based Proofs.
IACR Cryptol. ePrint Arch., 2023

Threshold BBS+ Signatures for Distributed Anonymous Credential Issuance.
IACR Cryptol. ePrint Arch., 2023

Threshold ECDSA in Three Rounds.
IACR Cryptol. ePrint Arch., 2023

Secure Multiparty Computation with Identifiable Abort from Vindicating Release.
IACR Cryptol. ePrint Arch., 2023

2022
Multiparty Generation of an RSA Modulus.
J. Cryptol., 2022

Improved Straight-Line Extraction in the Random Oracle Model With Applications to Signature Aggregation.
IACR Cryptol. ePrint Arch., 2022

Witness-Succinct Universally-Composable SNARKs.
IACR Cryptol. ePrint Arch., 2022

Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols.
IACR Cryptol. ePrint Arch., 2022

2021
Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures.
IACR Cryptol. ePrint Arch., 2021

2019
Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices.
IACR Cryptol. ePrint Arch., 2019

Threshold ECDSA from ECDSA Assumptions: The Multiparty Case.
IACR Cryptol. ePrint Arch., 2019

2018
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits.
IACR Cryptol. ePrint Arch., 2018

Secure Two-party Threshold ECDSA from ECDSA Assumptions.
IACR Cryptol. ePrint Arch., 2018

2017
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic.
IACR Cryptol. ePrint Arch., 2017


  Loading...