default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaymond K. Zhao
Person information
Other persons with a similar name
- Raymond Zhao
- Jun Zhao 0016 (aka: Jun Raymond Zhao) — Jet.com/Walmart Labs, Hoboken, NJ, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Raymond K. Zhao
, Sarah McCarthy, Ron Steinfeld, Amin Sakzad, Máire O'Neill:
Quantum-Safe HIBE: Does It Cost a Latte? IEEE Trans. Inf. Forensics Secur. 19: 2680-2695 (2024)- [j3]Wai-Kong Lee, Raymond K. Zhao, Ron Steinfeld, Amin Sakzad, Seong Oun Hwang:
High Throughput Lattice-Based Signatures on GPUs: Comparing Falcon and Mitaka. IEEE Trans. Parallel Distributed Syst. 35(4): 675-692 (2024) - [c8]Ron Steinfeld, Amin Sakzad, Muhammed F. Esgin, Veronika Kuchta, Mert Yassi, Raymond K. Zhao:
LUNA: Quasi-Optimally Succinct Designated-Verifier Zero-Knowledge Arguments from Lattices. CCS 2024: 3167-3181 - 2023
- [c7]Muhammed F. Esgin, Oguzhan Ersoy, Veronika Kuchta, Julian Loss, Amin Sakzad, Ron Steinfeld, Xiangwen Yang, Raymond K. Zhao:
A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum. AsiaCCS 2023: 623-637 - [c6]George Tasopoulos, Charis Dimopoulos, Apostolos P. Fournaris, Raymond K. Zhao, Amin Sakzad, Ron Steinfeld:
Energy Consumption Evaluation of Post-Quantum TLS 1.3 for Resource-Constrained Embedded Devices. CF 2023: 366-374 - [i11]Wai-Kong Lee, Raymond K. Zhao, Ron Steinfeld, Amin Sakzad, Seong Oun Hwang:
High Throughput Lattice-based Signatures on GPUs: Comparing Falcon and Mitaka. IACR Cryptol. ePrint Arch. 2023: 399 (2023) - [i10]George Tasopoulos, Charis Dimopoulos, Apostolos P. Fournaris, Raymond K. Zhao, Amin Sakzad, Ron Steinfeld:
Energy Consumption Evaluation of Post-Quantum TLS 1.3 for Resource-Constrained Embedded Devices. IACR Cryptol. ePrint Arch. 2023: 506 (2023) - 2022
- [c5]George Tasopoulos, Jinhui Li, Apostolos P. Fournaris, Raymond K. Zhao, Amin Sakzad, Ron Steinfeld:
Performance Evaluation of Post-Quantum TLS 1.3 on Resource-Constrained Embedded Systems. ISPEC 2022: 432-451 - [c4]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao:
Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications. Public Key Cryptography (1) 2022: 317-348 - [c3]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao:
MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments. SP 2022: 1281-1298 - [i9]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao:
Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications. IACR Cryptol. ePrint Arch. 2022: 142 (2022) - [i8]Muhammed F. Esgin, Oguzhan Ersoy, Veronika Kuchta, Julian Loss, Amin Sakzad, Ron Steinfeld, Wayne Yang, Raymond K. Zhao:
A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum. IACR Cryptol. ePrint Arch. 2022: 993 (2022) - 2021
- [i7]Raymond K. Zhao, Sarah McCarthy, Ron Steinfeld, Amin Sakzad, Máire O'Neill:
Quantum-safe HIBE: does it cost a Latte? IACR Cryptol. ePrint Arch. 2021: 222 (2021) - [i6]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao:
MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments. IACR Cryptol. ePrint Arch. 2021: 545 (2021) - [i5]George Tasopoulos, Jinhui Li, Apostolos P. Fournaris, Raymond K. Zhao, Amin Sakzad, Ron Steinfeld:
Performance Evaluation of Post-Quantum TLS 1.3 on Embedded Systems. IACR Cryptol. ePrint Arch. 2021: 1553 (2021) - 2020
- [j2]Raymond K. Zhao, Ron Steinfeld, Amin Sakzad:
FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers. IEEE Trans. Computers 69(1): 126-137 (2020) - [c2]Raymond K. Zhao, Ron Steinfeld, Amin Sakzad:
COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers. PQCrypto 2020: 284-303
2010 – 2019
- 2019
- [j1]Ron Steinfeld, Amin Sakzad, Raymond K. Zhao:
Practical $$\mathsf {MP} \text{- }\mathsf {LWE} $$ -based encryption balancing security-risk versus efficiency. Des. Codes Cryptogr. 87(12): 2847-2884 (2019) - [c1]Muhammed F. Esgin, Raymond K. Zhao, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol. CCS 2019: 567-584 - [i4]Raymond K. Zhao, Ron Steinfeld, Amin Sakzad:
Compact and Scalable Arbitrary-centered Discrete Gaussian Sampling over Integers. IACR Cryptol. ePrint Arch. 2019: 1011 (2019) - [i3]Ron Steinfeld, Amin Sakzad, Raymond K. Zhao:
Practical MP-LWE-based encryption balancing security-risk vs. efficiency. IACR Cryptol. ePrint Arch. 2019: 1179 (2019) - [i2]Muhammed F. Esgin, Raymond K. Zhao, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol. IACR Cryptol. ePrint Arch. 2019: 1287 (2019) - 2018
- [i1]Raymond K. Zhao, Ron Steinfeld, Amin Sakzad:
FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers. IACR Cryptol. ePrint Arch. 2018: 1234 (2018)
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 2024-12-11 20:46 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:
