Dmitry Kogan

According to our database1, Dmitry Kogan authored at least 13 papers between 1997 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
An Attack on TON's ADNL Secure Channel Protocol.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

2022
Single-Server Private Information Retrieval with Sublinear Amortized Time.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
The power and limits of preprocessing in cryptography.
PhD thesis, 2021

Private Blocklist Lookups with Checklist.
Proceedings of the 30th USENIX Security Symposium, 2021

2020
Private Information Retrieval with Sublinear Online Time.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Oblivious Pseudorandom Functions from Isogenies.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
The Function-Inversion Problem: Barriers and Opportunities.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018
The Discrete-Logarithm Problem with Preprocessing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
The Case For Secure Delegation.
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, Palo Alto, CA, USA, 2017

T/Key: Second-Factor Authentication From Secure Hash Chains.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2015
Sketching Cuts in Graphs and Hypergraphs.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2000
Remote Reference Counting: Distributed Garbage Collection with Low Communication and Computation Overhead.
J. Parallel Distributed Comput., 2000

1997
Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead.
Proceedings of the Algorithms, 1997


  Loading...