Allison Bishop

Affiliations:
  • Columbia University, New York City, USA


According to our database1, Allison Bishop authored at least 43 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Fully Anonymous Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Adversary Resilient Learned Bloom Filters.
IACR Cryptol. ePrint Arch., 2024

2023
What If Alice Wants Her Story Told?
IACR Cryptol. ePrint Arch., 2023

Defining and Controlling Information Leakage in US Equities Trading.
IACR Cryptol. ePrint Arch., 2023

2020
From discrete-log to lattices: maybe the real lessons were our broken schemes along the way?
IACR Cryptol. ePrint Arch., 2020

MicroCash: Practical Concurrent Processing of Micropayments.
Proceedings of the Financial Cryptography and Data Security, 2020

2019
In Pursuit of Clarity In Obfuscation.
IACR Cryptol. ePrint Arch., 2019

A cryptographic approach to black box adversarial machine learning.
CoRR, 2019

ABC: A Cryptocurrency-Focused Threat Modeling Framework.
Proceedings of the IEEE INFOCOM 2019, 2019

CAPnet: A Defense Against Cache Accounting Attacks on Content Distribution Networks.
Proceedings of the 7th IEEE Conference on Communications and Network Security, 2019

2018
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2016
Interactive Coding for Interactive Proofs.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Robust Secret Sharing Schemes Against Local Adversaries.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Essentially Optimal Robust Secret Sharing with Maximal Corruptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
Balancing Communication for Multi-party Interactive Coding.
CoRR, 2015

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Interactive Coding for Multiparty Protocols.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Bilinear Entropy Expansion from the Decisional Linear Assumption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

New Circular Security Counterexamples from Decision Linear and Learning with Errors.
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

Function-Hiding Inner Product Encryption.
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
Why Proving HIBE Systems Secure Is Difficult.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Witness Encryption from Instance Independent Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
On the complexity of asynchronous agreement against powerful adversaries.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Bounded-Collusion IBE from Key Homomorphism.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Formulas Resilient to Short-Circuit Errors.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Dual Form Signatures: An Approach for Proving Security from Static Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
On the structure of sets of large doubling.
Eur. J. Comb., 2011

The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Achieving Leakage Resilience through Dual System Encryption.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

How to leak on key updates.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Storing Secrets on Continually Leaky Devices.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Decentralizing Attribute-Based Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Unbounded HIBE and Attribute-Based Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

2010
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Revocation Systems with Very Small Private Keys.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

On the Insecurity of Parallel Repetition for Leakage Resilience.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Efficient pseudorandom functions from the decisional linear assumption and weaker variants.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009


  Loading...