default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgnes Hui Chan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c22]Tarik Moataz, Travis Mayberry, Erik-Oliver Blass, Agnes Hui Chan:
Resizable Tree-Based Oblivious RAM. Financial Cryptography 2015: 147-167- 2014
- [c21]Travis Mayberry, Erik-Oliver Blass, Agnes Hui Chan:
Efficient Private File Retrieval by Combining ORAM and PIR. NDSS 2014 - 2013
- [c20]Travis Mayberry, Erik-Oliver Blass, Agnes Hui Chan:
PIRMAP: Efficient Private Information Retrieval for MapReduce. Financial Cryptography 2013: 371-385 - [i3]Travis Mayberry, Erik-Oliver Blass, Agnes Hui Chan:
Path-PIR: Lower Worst-Case Bounds by Combining ORAM and PIR. IACR Cryptol. ePrint Arch. 2013: 86 (2013) - 2012
- [i2]Travis Mayberry, Erik-Oliver Blass, Agnes Hui Chan:
PIRMAP: Efficient Private Information Retrieval for MapReduce. IACR Cryptol. ePrint Arch. 2012: 398 (2012) - 2011
- [c19]Hamed Okhravi, Andrew Johnson, Joshua W. Haines, Travis Mayberry, Agnes Hui Chan:
Dedicated vs. distributed: A study of mission survivability metrics. MILCOM 2011: 1345-1350
2000 – 2009
- 2009
- [c18]Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu:
Approximation Algorithms for Key Management in Secure Multicast. COCOON 2009: 148-157 - [i1]Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu:
Approximation Algorithms for Key Management in Secure Multicast. CoRR abs/0904.4061 (2009) - 2005
- [c17]Duncan S. Wong, Agnes Hui Chan, Feng Zhu:
Password Authenticated Key Exchange for Resource-Constrained Wireless Communications (Extended Abstract). ICN (2) 2005: 827-834 - 2003
- [c16]Duncan S. Wong, Agnes Hui Chan, Feng Zhu:
More Efficient Password Authenticated Key Exchange Based on RSA. INDOCRYPT 2003: 375-387 - 2002
- [c15]Feng Zhu, Duncan S. Wong, Agnes Hui Chan, Robbie Ye:
Password Authenticated Key Exchange Based on RSA for Imbalanced Wireless Networks. ISC 2002: 150-161 - [e1]Agnes Hui Chan, Virgil D. Gligor:
Information Security, 5th International Conference, ISC 2002 Sao Paulo, Brazil, September 30 - October 2, 2002, Proceedings. Lecture Notes in Computer Science 2433, Springer 2002, ISBN 3-540-44270-7 [contents] - 2001
- [c14]Duncan S. Wong, Hector Ho Fuentes, Agnes Hui Chan:
The Performance Measurement of Cryptographic Primitives on Palm Devices. ACSAC 2001: 92-101 - [c13]Duncan S. Wong, Agnes Hui Chan:
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices. ASIACRYPT 2001: 272-289 - 2000
- [c12]Muxiang Zhang, Agnes Hui Chan:
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers. CRYPTO 2000: 501-514 - [c11]Muxiang Zhang, Christopher Carroll, Agnes Hui Chan:
The Software-Oriented Stream Cipher SSC2. FSE 2000: 31-48 - [c10]Muxiang Zhang, Christopher Carroll, Agnes Hui Chan:
Analysis of IS-95 CDMA Voice Privacy. Selected Areas in Cryptography 2000: 1-13
1990 – 1999
- 1998
- [c9]Agnes Hui Chan, Yair Frankel, Yiannis Tsiounis:
Easy Come - Easy Go Divisible Cash. EUROCRYPT 1998: 561-575 - 1997
- [c8]Agnes Hui Chan:
Electronic Commerce. LCN 1997 - 1996
- [c7]Agnes Hui Chan, Yair Frankel, Philip D. MacKenzie, Yiannis Tsiounis:
Mis-representation of Identities in E-cash Schemes and how to Prevent it. ASIACRYPT 1996: 276-285 - 1993
- [j12]Andrew Klapper, Agnes Hui Chan, Mark Goresky:
Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. Discret. Appl. Math. 46(1): 1-20 (1993) - [j11]Andrew Klapper, Agnes Hui Chan, Mark Goresky:
Cascaded GMW sequences. IEEE Trans. Inf. Theory 39(1): 177-183 (1993) - [c6]Agnes Hui Chan, Richard A. Games, Joseph J. Rushanan:
On Quadratic M-Sequences. FSE 1993: 166-173 - 1992
- [c5]Bob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey:
Threshold Schemes with Disenrollment. CRYPTO 1992: 540-548 - 1990
- [j10]Agnes Hui Chan, Richard A. Games:
On the linear span of binary sequences obtained from q-ary m-sequences, q odd. IEEE Trans. Inf. Theory 36(3): 548-552 (1990) - [j9]Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the linear complexity of feedback registers. IEEE Trans. Inf. Theory 36(3): 640-644 (1990) - [j8]Agnes Hui Chan, Richard A. Games:
On the quadratic spans of DeBruijn sequences. IEEE Trans. Inf. Theory 36(4): 822-829 (1990) - [c4]Agnes Hui Chan, Mark Goresky, Andrew Klapper:
Correlation Functions of Geometric Sequences. EUROCRYPT 1990: 214-221
1980 – 1989
- 1989
- [c3]Agnes Hui Chan, Richard A. Games:
On the Quadratic Spans of Periodic Sequences. CRYPTO 1989: 82-89 - [c2]Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the Linear Complexity of Feedback Registers (Extended Abstract). EUROCRYPT 1989: 563-570 - 1987
- [j7]Agnes Hui Chan:
Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs. IEEE Trans. Computers 36(2): 212-214 (1987) - 1986
- [c1]Agnes Hui Chan, Richard A. Games:
On the Linear Span of binary Sequences Obtained from Finite Geometries. CRYPTO 1986: 405-417 - 1983
- [j6]Richard A. Games, Agnes Hui Chan:
A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans. Inf. Theory 29(1): 144-146 (1983) - 1982
- [j5]Agnes Hui Chan, Dwijendra K. Ray-Chaudhuri:
Embedding of a Pseudo-residual Design into a Möbius Plane. J. Comb. Theory A 32(1): 73-98 (1982) - [j4]Agnes Hui Chan, Richard A. Games, Edwin L. Key:
On the Complexities of de Bruijn Sequences. J. Comb. Theory A 33(3): 233-246 (1982) - 1981
- [j3]Agnes Hui Chan:
Embedding of a pseudo-point residual design into a Möbius plane. Discret. Math. 37(1): 29-33 (1981) - [j2]Agnes Hui Chan, Richard A. Games:
(n, k, t)-covering systems and error-trapping decoding. IEEE Trans. Inf. Theory 27(5): 643-646 (1981)
1970 – 1979
- 1979
- [j1]Agnes Hui Chan:
Characterization of "Linegraph of an Affine Space". J. Comb. Theory A 26(1): 48-64 (1979)
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 2025-01-09 13:07 CET 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:
