default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkshima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. J. Cryptol. 37(2): 10 (2024)- [c8]Akshima:
Time-Space Tradeoffs for Finding Multi-Collisions in Merkle-Damgård Hash Functions. ITC 2024: 9:1-9:22 - [c7]Akshima
, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye:
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. STOC 2024: 1739-1749 - [i6]Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye:
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. IACR Cryptol. ePrint Arch. 2024: 1171 (2024) - 2023
- [c6]Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. TCC (3) 2023: 237-270 - [i5]Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. IACR Cryptol. ePrint Arch. 2023: 1444 (2023) - 2022
- [c5]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. CRYPTO (3) 2022: 192-221 - [i4]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2022: 885 (2022) - 2020
- [c4]Francesca Falzon, Evangelia Anna Markatou, Akshima, David Cash, Adam Rivkin, Jesse Stern, Roberto Tamassia:
Full Database Reconstruction in Two Dimensions. CCS 2020: 443-460 - [c3]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. CRYPTO (1) 2020: 157-186 - [i3]Akshima, David Cash, Francesca Falzon, Adam Rivkin, Jesse Stern:
Multidimensional Database Reconstruction from Range Query Access Patterns. IACR Cryptol. ePrint Arch. 2020: 296 (2020) - [i2]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2020: 770 (2020)
2010 – 2019
- 2019
- [j1]Akshima, Donghoon Chang, Aarushi Goel, Sweta Mishra, Somitra Kumar Sanadhya:
Generation of Secure and Reliable Honeywords, Preventing False Detection. IEEE Trans. Dependable Secur. Comput. 16(5): 757-769 (2019) - 2015
- [c2]Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya:
Single Key Recovery Attacks on 9-Round Kalyna-128/256 and Kalyna-256/512. ICISC 2015: 119-135 - [c1]Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya:
Improved Meet-in-the-Middle Attacks on 7 and 8-Round ARIA-192 and ARIA-256. INDOCRYPT 2015: 198-217 - [i1]Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya:
Single Key Recovery Attacks on 9-round Kalyna-128/256 and Kalyna-256/512. IACR Cryptol. ePrint Arch. 2015: 1227 (2015)
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-21 00:01 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:
