Allison Bishop

Affiliations:
  • Columbia University, New York City, USA


According to our database1, Allison Bishop authored at least 42 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Defining and Controlling Information Leakage in US Equities Trading.
Proc. Priv. Enhancing Technol., 2024

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

2023
What If Alice Wants Her Story Told?
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.
IACR Cryptol. ePrint Arch., 2018

2015
Essentially Optimal Robust Secret Sharing with Maximal Corruptions.
IACR Cryptol. ePrint Arch., 2015

Function-Hiding Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2015

New Circular Security Counterexamples from Decision Linear and Learning with Errors.
IACR Cryptol. ePrint Arch., 2015

On the complexity of asynchronous agreement against powerful adversaries.
Distributed Comput., 2015

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

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

2014
Robust Secret Sharing Schemes Against Local Adversaries.
IACR Cryptol. ePrint Arch., 2014

Bilinear Entropy Expansion from the Decisional Linear Assumption.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory.
IACR Cryptol. ePrint Arch., 2014

Witness Encryption from Instance Independent Assumptions.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption.
IACR Cryptol. ePrint Arch., 2014

Interactive Coding for Interactive Proofs.
IACR Cryptol. ePrint Arch., 2014

2013
Why Proving HIBE Systems Secure is Difficult.
IACR Cryptol. ePrint Arch., 2013

A Profitable Sub-Prime Loan: Obtaining the Advantages of Composite-Order in Prime-Order Bilinear Groups.
IACR Cryptol. ePrint Arch., 2013

2012
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.
IACR Cryptol. ePrint Arch., 2012

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security.
IACR Cryptol. ePrint Arch., 2012

Dual Form Signatures: An Approach for Proving Security from Static Assumptions.
IACR Cryptol. ePrint Arch., 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

2011
Unbounded HIBE and Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2011

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting.
IACR Cryptol. ePrint Arch., 2011

Storing Secrets on Continually Leaky Devices.
IACR Cryptol. ePrint Arch., 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

2010
On the Insecurity of Parallel Repetition for Leakage Resilience.
IACR Cryptol. ePrint Arch., 2010

Decentralizing Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2010

Achieving Leakage Resilience Through Dual System Encryption.
IACR Cryptol. ePrint Arch., 2010

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2010

How to Leak on Key Updates.
IACR Cryptol. ePrint Arch., 2010

2009
Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants.
IACR Cryptol. ePrint Arch., 2009

New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts.
IACR Cryptol. ePrint Arch., 2009

2008
Revocation Systems with Very Small Private Keys.
IACR Cryptol. ePrint Arch., 2008


  Loading...