Abhi Shelat

According to our database1, Abhi Shelat authored at least 72 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Minimizing Trust in Hardware Wallets with Two Factor Signatures.
IACR Cryptology ePrint Archive, 2019

Threshold ECDSA from ECDSA Assumptions: The Multiparty Case.
IACR Cryptology ePrint Archive, 2019

Securely Sampling Biased Coins with Applications to Differential Privacy.
IACR Cryptology ePrint Archive, 2019

2018
Blind Certificate Authorities.
IACR Cryptology ePrint Archive, 2018

Multi-Key Searchable Encryption, Revisited.
IACR Cryptology ePrint Archive, 2018

Secure Two-party Threshold ECDSA from ECDSA Assumptions.
IACR Cryptology ePrint Archive, 2018

Adaptively Secure MPC with Sublinear Communication Complexity.
IACR Cryptology ePrint Archive, 2018

A Better Method to Analyze Blockchain Consistency.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Doubly-efficient zkSNARKs without trusted setup.
IACR Cryptology ePrint Archive, 2017

Full accounting for verifiable outsourcing.
IACR Cryptology ePrint Archive, 2017

Scaling ORAM for Secure Computation.
IACR Cryptology ePrint Archive, 2017

Socially Optimal Mining Pools.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

2016
Secure Channel Injection and Anonymous Proofs of Account Ownership.
IACR Cryptology ePrint Archive, 2016

Analysis of the Blockchain Protocol in Asynchronous Networks.
IACR Cryptology ePrint Archive, 2016

Micropayments for Decentralized Currencies.
IACR Cryptology ePrint Archive, 2016

Bounded KDM Security from iO and OWF.
IACR Cryptology ePrint Archive, 2016

A Note on Black-Box Complexity of Indistinguishability Obfuscation.
IACR Cryptology ePrint Archive, 2016

Secure Stable Matching at Scale.
IACR Cryptology ePrint Archive, 2016

The Cut-and-Choose Game and Its Application to Cryptographic Protocols.
Proceedings of the 25th USENIX Security Symposium, 2016

2015
Computing on Authenticated Data.
J. Cryptology, 2015

An Overview of ANONIZE: A Large-Scale Anonymous Survey System.
IEEE Security & Privacy, 2015

Verifiable ASICs.
IACR Cryptology ePrint Archive, 2015

Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings.
IACR Cryptology ePrint Archive, 2015

Lower Bounds on Assumptions behind Indistinguishability Obfuscation.
IACR Cryptology ePrint Archive, 2015

How to Use SNARKs in Universally Composable Protocols.
IACR Cryptology ePrint Archive, 2015

ANONIZE: A Large-Scale Anonymous Survey System.
IACR Cryptology ePrint Archive, 2015

Compression-Aware Algorithms for Massive Datasets.
Proceedings of the 2015 Data Compression Conference, 2015

Secure Computation from Millionaire.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
SCORAM: Oblivious RAM for Secure Computation.
IACR Cryptology ePrint Archive, 2014

2013
Black-box construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness.
Journal of Computer Security, 2013

Fast Two-Party Secure Computation with Minimal Assumptions.
IACR Cryptology ePrint Archive, 2013

PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation.
Proceedings of the 22th USENIX Security Symposium, Washington, DC, USA, August 14-16, 2013, 2013

Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Algorithms for Compressed Inputs.
Proceedings of the 2013 Data Compression Conference, 2013

Lessons learned with PCF: scaling secure computation.
Proceedings of the PETShop'13, 2013

GPU and CPU parallelization of honest-but-curious secure two-party computation.
Proceedings of the Annual Computer Security Applications Conference, 2013

2012
Towards Billion-Gate Secure Computation with Malicious Adversaries.
IACR Cryptology ePrint Archive, 2012

Billion-Gate Secure Computation with Malicious Adversaries.
Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, August 8-10, 2012, 2012

Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

2011
Securely Obfuscating Re-Encryption.
J. Cryptology, 2011

Two-Output Secure Computation with Malicious Adversaries.
IACR Cryptology ePrint Archive, 2011

Threshold Fully Homomorphic Encryption and Secure Computation.
IACR Cryptology ePrint Archive, 2011

Renegotiation-Safe Protocols.
Proceedings of the Innovations in Computer Science, 2011

Efficient Secure Computation with Garbled Circuits.
Proceedings of the Information Systems Security - 7th International Conference, 2011

2010
Collusion-free protocols.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

Optimistic Concurrent Zero Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Additive Combinatorics and Discrete Logarithm Based Range Protocols.
IACR Cryptology ePrint Archive, 2009

Purely Rational Secret Sharing (Extended Abstract).
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Bit Encryption Is Complete.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Collusion-Free Multiparty Computation in the Mediated Model.
Proceedings of the Advances in Cryptology, 2009

2008
Simulatable Adaptive Oblivious Transfer.
IACR Cryptology ePrint Archive, 2008

Collusion-Free Protocols in the Mediated Model.
Proceedings of the Advances in Cryptology, 2008

Efficient Protocols for Set Membership and Range Proofs.
Proceedings of the Advances in Cryptology, 2008

2007
Efficient fork-linearizable access to untrusted shared memory.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Cryptography from Sunspots: How to Use an Imperfect Reference String.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Relations Among Notions of Non-malleability for Encryption.
Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.
Proceedings of the Advances in Cryptology, 2007

2006
Securing user inputs for the web.
Proceedings of the 2006 Workshop on Digital Identity Management, 2006

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
Proceedings of the Advances in Cryptology, 2006

2005
Études in non-interactive zero-knowledge.
PhD thesis, 2005

The smallest grammar problem.
IEEE Trans. Information Theory, 2005

Fair-Zero Knowledge.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Collusion-free protocols.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Privacy and identity management for everyone.
Proceedings of the 2005 Workshop on Digital Identity Management, 2005

Unconditional Characterizations of Non-interactive Zero-Knowledge.
Proceedings of the Advances in Cryptology, 2005

2004
Completely fair SFE and coalition-safe cheap talk.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Searching for Stable Mechanisms: Automated Design for Imperfect Players.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Remembrance of Data Passed: A Study of Disk Sanitization Practices.
IEEE Security & Privacy, 2003

IEEE Security & Privacy: Data Forensics - Rememberance of Data Passed: A Study of Disk Sanitization Practices.
IEEE Distributed Systems Online, 2003

Lower bounds for collusion-secure fingerprinting.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Approximating the smallest grammar: Kolmogorov complexity in natural models.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Approximation algorithms for grammar-based compression.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002


  Loading...