Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Nirvan Tyagi
Mangrove: A Scalable Framework for Folding-based SNARKs
Paper 2024/416 , Stanford University , Stanford University , Stanford University , Stanford University , Stanford University We present a framework for building efficient folding-based SNARKs. First we develop a new "uniformizing" compiler for NP statements that converts any poly-time computation to a sequence of identical simple steps. The resulting uniform computation is especially well-suited to be processed by a folding-based IVC scheme.
Riggs: Decentralized Sealed-Bid Auctions
Paper 2023/1336 , Cornell University , New York University , Cornell Tech , Carnegie Mellon University, Cubist , New York University, a16z crypto research , Stanford University We introduce the first practical protocols for fully decentralized sealed-bid auctions using timed commitments. Timed commitments ensure that the auction is finalized fairly even if all participants drop out after posting bids or if $n-1$ bidders collude to try to learn the $n^{th}$ bidder’s bid value.
Handling Adaptive Compromise for Practical Encryption Schemes
Paper 2020/765 Handling Adaptive Compromise for Practical Encryption Schemes , University of Washington , Cornell University Abstract We provide a new definitional framework capturing the multi-user security of encryption schemes and pseudorandom functions in the face of adversaries that can adaptively compromise users' keys. We provide a sequence of results establishing the security of practical symmetric encryption schemes under adaptive compromise in the random oracle or ideal cipher model.
MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups
Paper 2023/974 MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups , Stanford University , Stanford University , Stanford University , Cornell University Abstract Proofs for machine computation allow for proving the correct execution of arbitrary programs that operate over fixed instruction sets (e.g., RISC-V, EVM, Wasm).
Bicorn: An optimistically efficient distributed randomness beacon
Paper 2023/221 Bicorn: An optimistically efficient distributed randomness beacon , New York University , New York University , Cornell University , New York University, a16z Crypto Research Abstract We introduce Bicorn, an optimistically efficient distributed randomness protocol with strong robustness under a dishonest majority. Bicorn is a "commit-reveal-recover" protocol. Each participant commits to a random value, which are combined to produce a random output.
VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries
Paper 2021/627 VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries , Cornell University , Yale University , New York University , New York University , University of Washington Abstract Verifiable registries allow clients to securely access a key-value mapping maintained by an untrusted server.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Nirvan
Contact Nirvan, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack