Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnie Brickell
Person information
- affiliation: Intel, Santa Clara, CA, USA
- affiliation (former): Sandia National Laboratories, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j10]Ernie Brickell, Jiangtao Li:
Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities. IEEE Trans. Dependable Secur. Comput. 9(3): 345-360 (2012)- [c33]Ernie Brickell:
Recent Advances and Existing Research Questions in Platform Security. CRYPTO 2012: 570 - [c32]Ernie Brickell, Liqun Chen
, Jiangtao Li:
A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes. INTRUST 2012: 95-111 - 2011
- [j9]Ernie Brickell, Jiangtao Li:
Enhanced privacy ID from bilinear pairing for hardware authentication and attestation. Int. J. Inf. Priv. Secur. Integr. 1(1): 3-33 (2011) - [c31]Ernie Brickell, Liqun Chen, Jiangtao Li:
A (Corrected) DAA Scheme Using Batch Proof and Verification. INTRUST 2011: 304-337 - 2010
- [c30]Ernie Brickell, Jiangtao Li:
Enhanced Privacy ID from Bilinear Pairing for Hardware Authentication and Attestation. SocialCom/PASSAT 2010: 768-775 - [c29]Ernie Brickell, Jiangtao Li:
A Pairing-Based DAA Scheme Further Reducing TPM Resources. TRUST 2010: 181-195 - [i7]Ernie Brickell, Jiangtao Li:
A Pairing-Based DAA Scheme Further Reducing TPM Resources. IACR Cryptol. ePrint Arch. 2010: 67 (2010)
2000 – 2009
- 2009
- [j8]Ernie Brickell, Liqun Chen, Jiangtao Li:
Simplified security notions of direct anonymous attestation and a concrete scheme from pairings. Int. J. Inf. Sec. 8(5): 315-330 (2009) - [i6]Ernie Brickell, Jiangtao Li:
Enhanced Privacy ID from Bilinear Pairing. IACR Cryptol. ePrint Arch. 2009: 95 (2009) - 2008
- [c28]Ernie Brickell:
A Vision for Platform Security. CHES 2008: 444 - [c27]Ernie Brickell, Liqun Chen, Jiangtao Li:
A New Direct Anonymous Attestation Scheme from Bilinear Maps. TRUST 2008: 166-178 - [i5]Ernie Brickell, Liqun Chen, Jiangtao Li:
Simplified Security Notions of Direct Anonymous Attestation and a Concrete Scheme from Pairings. IACR Cryptol. ePrint Arch. 2008: 104 (2008) - 2007
- [c26]Ernie Brickell, Jiangtao Li:
Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities. WPES 2007: 21-30 - [i4]Ernie Brickell, Jiangtao Li:
Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities. IACR Cryptol. ePrint Arch. 2007: 194 (2007) - 2006
- [i3]Ernie Brickell, Gary Graunke, Michael Neve, Jean-Pierre Seifert:
Software mitigations to hedge AES against cache-based software side channel vulnerabilities. IACR Cryptol. ePrint Arch. 2006: 52 (2006) - 2004
- [c25]Ernest F. Brickell, Jan Camenisch, Liqun Chen:
Direct anonymous attestation. CCS 2004: 132-145 - [i2]Ernie Brickell, Jan Camenisch, Liqun Chen:
Direct Anonymous Attestation. IACR Cryptol. ePrint Arch. 2004: 205 (2004) - 2000
- [c24]Ernest F. Brickell, Giovanni Di Crescenzo, Yair Frankel:
Sharing Block Ciphers. ACISP 2000: 457-470 - [c23]Ernest F. Brickell, David Pointcheval, Serge Vaudenay, Moti Yung:
Design Validations for Discrete Logarithm Based Signature Schemes. Public Key Cryptography 2000: 276-292
1990 – 1999
- 1995
- [c22]Ernest F. Brickell, Peter Gemmell, David W. Kravitz:
Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change. SODA 1995: 457-466 - 1993
- [j7]Ernest F. Brickell, Michael E. Saks:
The Number of Distinct Subset Sums of a Finite Set of Vectors. J. Comb. Theory, Ser. A 63(2): 234-256 (1993) - [e1]Ernest F. Brickell:
Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings. Lecture Notes in Computer Science 740, Springer 1993, ISBN 3-540-57340-2 [contents] - 1992
- [j6]Ernest F. Brickell, Kevin S. McCurley:
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. J. Cryptol. 5(1): 29-39 (1992) - [j5]Ernest F. Brickell, Douglas R. Stinson:
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. J. Cryptol. 5(3): 153-166 (1992) - [c21]Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson:
Fast Exponentiation with Precomputation (Extended Abstract). EUROCRYPT 1992: 200-207 - 1991
- [j4]Ernest F. Brickell, Daniel M. Davenport:
On the Classification of Ideal Secret Sharing Schemes. J. Cryptol. 4(2): 123-134 (1991) - [j3]Ernest F. Brickell, Douglas R. Stinson:
The Detection of Cheaters in Threshold Schemes. SIAM J. Discret. Math. 4(4): 502-510 (1991) - 1990
- [j2]Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma:
On the Structure of Minimum-Weight k-Connected Spanning Networks. SIAM J. Discret. Math. 3(3): 320-329 (1990) - [c20]Ernest F. Brickell, Douglas R. Stinson:
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. CRYPTO 1990: 242-252 - [c19]Ernest F. Brickell, Kevin S. McCurley:
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. EUROCRYPT 1990: 63-71
1980 – 1989
- 1989
- [c18]Ernest F. Brickell, Daniel M. Davenport:
On the Classification of Idea Secret Sharing Schemes. CRYPTO 1989: 278-285 - [c17]Ernest F. Brickell:
A Survey of Hardware Implementation of RSA (Abstract). CRYPTO 1989: 368-370 - [c16]Michael Bertilsson, Ernest F. Brickell, Ingemar Ingemarsson:
Cryptanalysis of Video Encryption Based on Space-Filling Curves. EUROCRYPT 1989: 403-411 - [c15]Ernest F. Brickell:
Some Ideal Secret Sharing Schemes. EUROCRYPT 1989: 468-475 - 1988
- [j1]Ernest F. Brickell, Andrew M. Odlyzko:
Cryptanalysis: a survey of recent results. Proc. IEEE 76(5): 578-593 (1988) - [c14]Ernest F. Brickell, Douglas R. Stinson:
The Detection of Cheaters in Threshold Schemes. CRYPTO 1988: 564-577 - [c13]Ernest F. Brickell, Douglas R. Stinson:
Authentication Codes with Multiple Arbiters (Extended Abstract). EUROCRYPT 1988: 51-55 - [c12]Pil Joong Lee, Ernest F. Brickell:
An Observation on the Security of McEliece's Public-Key Cryptosystem. EUROCRYPT 1988: 275-280 - 1987
- [c11]Ernest F. Brickell, David Chaum, Ivan Damgård, Jeroen van de Graaf:
Gradual and Verifiable Release of a Secret. CRYPTO 1987: 156-166 - [c10]Ernest F. Brickell, Pil Joong Lee, Yacov Yacobi:
Secure Audio Teleconference. CRYPTO 1987: 418-426 - [c9]Ernest F. Brickell, Yacov Yacobi:
On Privacy Homomorphisms (Extended Abstract). EUROCRYPT 1987: 117-125 - 1986
- [c8]Ernest F. Brickell, Judy H. Moore, M. R. Purtill:
Structure in the S-boxes of the DES. CRYPTO 1986: 3-8 - [i1]Ernest F. Brickell:
Cryptanalysis of the Yagisawa Public Key Cryptosystem. EUROCRYPT 1986: 21-22 - 1985
- [c7]Ernest F. Brickell, John M. DeLaurentis:
An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi. CRYPTO 1985: 28-32 - 1984
- [c6]Ernest F. Brickell:
Breaking Iterated Knapsacks. CRYPTO 1984: 342-358 - 1983
- [c5]Ernest F. Brickell:
Solving Low Density Knapsacks. CRYPTO 1983: 25-37 - [c4]Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko:
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO 1983: 39-42 - 1982
- [c3]Ernest F. Brickell, Judy H. Moore:
Some Remarks on the Herlestam-Johannesson Algorithm for Computing Logarithms over GF(2p). CRYPTO 1982: 15-19 - [c2]Ernest F. Brickell:
A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography. CRYPTO 1982: 51-60 - [c1]Ernest F. Brickell, James A. Davis, Gustavus J. Simmons:
A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems. CRYPTO 1982: 289-301
Coauthor Index
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 2023-09-27 22:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
