Stuart Haber

According to our database1, Stuart Haber authored at least 26 papers between 1985 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb.
CoRR, 2019

Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb.
Proceedings of the 2019 IEEE European Symposium on Security and Privacy Workshops, 2019

2016
Efficient Transparent Redactable Signatures with a Single Signature Invocation.
IACR Cryptology ePrint Archive, 2016

Silent Shredder: Zero-Cost Shredding for Secure Non-Volatile Main Memory Controllers.
Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, 2016

2013
Efficient Submatch Extraction for Practical Regular Expressions.
Proceedings of the Language and Automata Theory and Applications, 2013

On the Isolation of a Common Secret.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
Authenticating a mobile device's location using voice signatures.
Proceedings of the 8th IEEE International Conference on Wireless and Mobile Computing, 2012

2011
Time-Stamping.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2009
Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases.
Proceedings of the Privacy Enhancing Technologies, 9th International Symposium, 2009

2008
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification.
Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, 2008

2007
Long-lived digital integrity using short-lived hash functions.
IACR Cryptology ePrint Archive, 2007

2003
If Piracy Is the Problem, Is DRM the Answer?
Proceedings of the Digital Rights Management, 2003

2001
Securely combining public-key cryptosystems.
Proceedings of the CCS 2001, 2001

1998
New Constructions for Secure Hash Functions.
Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

1997
Secure Names for Bit-Strings.
Proceedings of the CCS '97, 1997

1996
Joint Encryption and Message-Efficient Secure Computation.
J. Cryptology, 1996

1993
Joint Encryption and Message-Efficient Secure Computation.
Proceedings of the Advances in Cryptology, 1993

1992
Cryptographic Protocols Provably Secure Against Dynamic Adversaries.
Proceedings of the Advances in Cryptology, 1992

1991
How to Time-Stamp a Digital Document.
J. Cryptology, 1991

1990
How to Time-Stamp a Digital Document.
Proceedings of the Advances in Cryptology, 1990

1989
Minimum-Knowledge Interactive Proofs for Decision Problems.
SIAM J. Comput., 1989

A Secure Public-key Authentication Scheme.
Proceedings of the Advances in Cryptology, 1989

Security against Replay Chosen-Ciphertext Attack.
Proceedings of the Distributed Computing And Cryptography, 1989

1987
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model.
Proceedings of the Advances in Cryptology, 1987

1985
A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Symmetric Public-Key Encryption.
Proceedings of the Advances in Cryptology, 1985


  Loading...