![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Stuart Haber
Person information
- affiliation: Hewlett Packard Enterprise Labs, Princeton, NJ, USA
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c17]Tarun Chitra, Monica Quaintance, Stuart Haber, Will Martino:
Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb. EuroS&P Workshops 2019: 386-395 - [i3]Tarun Chitra, Monica Quaintance, Stuart Haber, Will Martino:
Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb. CoRR abs/1904.12924 (2019) - 2016
- [c16]Amro Awad, Pratyusa K. Manadhata, Stuart Haber, Yan Solihin, William G. Horne:
Silent Shredder: Zero-Cost Shredding for Secure Non-Volatile Main Memory Controllers. ASPLOS 2016: 263-276 - [i2]Stuart Haber, William G. Horne, Miaomiao Zhang:
Efficient Transparent Redactable Signatures with a Single Signature Invocation. IACR Cryptol. ePrint Arch. 2016: 1165 (2016) - 2013
- [c15]Stuart Haber, William G. Horne, Pratyusa K. Manadhata, Miranda Mowbray, Prasad Rao:
Efficient Submatch Extraction for Practical Regular Expressions. LATA 2013: 323-334 - [p2]Donald Beaver, Stuart Haber, Peter Winkler
:
On the Isolation of a Common Secret. The Mathematics of Paul Erdős II 2013: 21-38 - 2012
- [c14]Jack Brassil, Ravi Netravali, Stuart Haber, Pratyusa K. Manadhata, Prasad Rao:
Authenticating a mobile device's location using voice signatures. WiMob 2012: 458-465 - 2011
- [r2]Stuart Haber, Henri Massias:
Time-Stamping. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1299-1303
2000 – 2009
- 2009
- [c13]Brian Thompson, Stuart Haber, William G. Horne, Tomas Sander, Danfeng Yao
:
Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases. Privacy Enhancing Technologies 2009: 185-201 - 2008
- [c12]Stuart Haber, Yasuo Hatano, Yoshinori Honda, William G. Horne, Kunihiko Miyazaki, Tomas Sander, Satoru Tezoku, Danfeng Yao
:
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification. AsiaCCS 2008: 353-362 - 2007
- [i1]Stuart Haber:
Long-lived digital integrity using short-lived hash functions. IACR Cryptol. ePrint Arch. 2007: 238 (2007) - 2005
- [r1]Stuart Haber, Henri Massias:
Time-stamping. Encyclopedia of Cryptography and Security 2005 - 2003
- [p1]Stuart Haber, Bill G. Horne, Joe Pato, Tomas Sander, Robert Endre Tarjan:
If Piracy Is the Problem, Is DRM the Answer? Digital Rights Management 2003: 224-233 - 2001
- [c11]Stuart Haber, Benny Pinkas:
Securely combining public-key cryptosystems. CCS 2001: 215-224
1990 – 1999
- 1998
- [c10]William Aiello, Stuart Haber, Ramarathnam Venkatesan:
New Constructions for Secure Hash Functions. FSE 1998: 150-167 - 1997
- [c9]Stuart Haber, W. Scott Stornetta:
Secure Names for Bit-Strings. CCS 1997: 28-35 - 1996
- [j3]Matthew K. Franklin, Stuart Haber:
Joint Encryption and Message-Efficient Secure Computation. J. Cryptol. 9(4): 217-232 (1996) - 1993
- [c8]Matthew K. Franklin, Stuart Haber:
Joint Encryption and Message-Efficient Secure Computation. CRYPTO 1993: 266-277 - 1992
- [c7]Donald Beaver, Stuart Haber:
Cryptographic Protocols Provably Secure Against Dynamic Adversaries. EUROCRYPT 1992: 307-323 - 1991
- [j2]Stuart Haber, W. Scott Stornetta:
How to Time-Stamp a Digital Document. J. Cryptol. 3(2): 99-111 (1991) - 1990
- [c6]Stuart Haber, W. Scott Stornetta:
How to Time-Stamp a Digital Document. CRYPTO 1990: 437-455
1980 – 1989
- 1989
- [j1]Zvi Galil, Stuart Haber, Moti Yung:
Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM J. Comput. 18(4): 711-739 (1989) - [c5]Zvi Galil, Stuart Haber, Moti Yung:
Security against Replay Chosen-Ciphertext Attack. Distributed Computing And Cryptography 1989: 183-190 - [c4]Zvi Galil, Stuart Haber, Moti Yung:
A Secure Public-key Authentication Scheme. EUROCRYPT 1989: 3-15 - 1987
- [c3]Zvi Galil, Stuart Haber, Moti Yung:
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. CRYPTO 1987: 135-155 - 1985
- [c2]Zvi Galil, Stuart Haber, Moti Yung:
Symmetric Public-Key Encryption. CRYPTO 1985: 128-137 - [c1]Zvi Galil, Stuart Haber, Moti Yung:
A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract). FOCS 1985: 360-371
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint