Akshima

According to our database, Akshima authored at least 10 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions.

Akshima, Siyao Guo, Qipeng Liu

J. Cryptol., June, 2024

Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem.

Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye

IACR Cryptol. ePrint Arch., 2024

Time-Space Tradeoffs for Finding Multi-Collisions in Merkle-Damgård Hash Functions.

Akshima

Proceedings of the 5th Conference on Information-Theoretic Cryptography, 2024

2023

On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions.

Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu

IACR Cryptol. ePrint Arch., 2023

2020

Multidimensional Database Reconstruction from Range Query Access Patterns.

Akshima, David Cash, Francesca Falzon, Adam Rivkin, Jesse Stern

IACR Cryptol. ePrint Arch., 2020

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions.

Akshima, David Cash, Andrew Drucker, Hoeteck Wee

IACR Cryptol. ePrint Arch., 2020

Full Database Reconstruction in Two Dimensions.

Francesca Falzon, Evangelia Anna Markatou, Akshima, David Cash, Adam Rivkin, Jesse Stern, Roberto Tamassia

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

Generation of Secure and Reliable Honeywords, Preventing False Detection.

Akshima, Donghoon Chang, Aarushi Goel, Sweta Mishra, Somitra Kumar Sanadhya

IEEE Trans. Dependable Secur. Comput., 2019

2015

Single Key Recovery Attacks on 9-round Kalyna-128/256 and Kalyna-256/512.

Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya

IACR Cryptol. ePrint Arch., 2015

Improved Meet-in-the-Middle Attacks on 7 and 8-Round ARIA-192 and ARIA-256.

Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya

Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015