Yevgeniy Dodis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yevgeniy Dodis has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Jost
New York University
6 shared publications - Daniel Wichs
Northeastern University
5 shared publications - Antonio Marcedone
Zoom Video Communications
3 shared publications - Eli Goldin
New York University
3 shared publications - Paul Rösler
FAU Erlangen-Nürnberg, Erlangen, Germany
3 shared publications - Peter Hall
New York University
3 shared publications
Latest Publications
- Open Access
- 9 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1465-1476
Locally Computable High Independence Hashing
We consider (almost) k-wise independent hash functions, whose evaluations on any k inputs are (almost) uniformly random, for very large values of k. Such hash functions need to have a large key that grows linearly with k. However, it may be possible to evaluate them in sub-linear time by only reading a small subset of t ≪ k locations during each evaluation; we call such hash functions t-local. Such hash functions have applications to nearly optimal bounded-use information-theoretic cryptography. Local hash functions were previously studied in several works starting with Siegel (FOCS’89, SICOMP’04). For a hash function with n-bit input and output size, we get the following new results: (A) There exist (non-constructively) perfectly k-wise independent t-local hash functions with key size O(kn) and locality of t = O(n) bits. Furthermore, we show that such hash functions could be made explicit if we had explicit optimal constructions of unbalanced bipartite lossless expanders. Plugging in currently best known suboptimal explicit expanders yields correspondingly suboptimal hash functions. (B) Perfectly k-wise independent local hash functions generically yield expanders with corresponding parameters. This is true even if the locations accessed by the hash function can be chosen adaptively. (C) We initiate the study of -almost k-wise independent hash functions, where any k adaptive queries to the hash function are є-statistically indistinguishable from k queries to a random function. We construct an explicit family of such hash functions with optimal key size O(kn) bits, optimal locality t = O(n) bits, and = 2−n. (D) More generally, in a word model with word size w, we get an explicit, efficient construction of -almost k-wise independent hash functions with key size O(kn/w) words, locality t = O(n/√w) words, and statistical distance = 2−n, which we show to be nearly optimal.
- 9 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1465-1476
Open AccessLocally Computable High Independence Hashing
We consider (almost) k-wise independent hash functions, whose evaluations on any k inputs are (almost) uniformly random, for very large values of k. Such hash functions need to have a large key that grows linearly with k. However, it may be possible to evaluate them in sub-linear time by only reading a small subset of t ≪ k locations during each evaluation; we call such hash functions t-local. Such hash functions have applications to nearly optimal bounded-use information-theoretic cryptography. Local hash functions were previously studied in several works starting with Siegel (FOCS’89, SICOMP’04). For a hash function with n-bit input and output size, we get the following new results: (A) There exist (non-constructively) perfectly k-wise independent t-local hash functions with key size O(kn) and locality of t = O(n) bits. Furthermore, we show that such hash functions could be made explicit if we had explicit optimal constructions of unbalanced bipartite lossless expanders. Plugging in currently best known suboptimal explicit expanders yields correspondingly suboptimal hash functions. (B) Perfectly k-wise independent local hash functions generically yield expanders with corresponding parameters. This is true even if the locations accessed by the hash function can be chosen adaptively. (C) We initiate the study of -almost k-wise independent hash functions, where any k adaptive queries to the hash function are є-statistically indistinguishable from k queries to a random function. We construct an explicit family of such hash functions with optimal key size O(kn) bits, optimal locality t = O(n) bits, and = 2−n. (D) More generally, in a word model with word size w, we get an explicit, efficient construction of -almost k-wise independent hash functions with key size O(kn/w) words, locality t = O(n/√w) words, and statistical distance = 2−n, which we show to be nearly optimal.
- 24 May 2026
- Published by Springer Nature
- p. 37-66
Perpetual Encryption
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 350-364
Generic Anonymity Wrapper for Messaging Protocols
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 350-364
Open AccessGeneric Anonymity Wrapper for Messaging Protocols
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 440-471
Anamorphic-Resistant Encryption; Or Why the Encryption Debate is Still Alive
- 17 August 2025
- Published by Springer Nature
- p. 440-471
Open AccessAnamorphic-Resistant Encryption; Or Why the Encryption Debate is Still Alive
- 17 August 2025
- Published by Springer Nature
- p. 39-74
Guarding the Signal: Secure Messaging with Reverse Firewalls
- 17 August 2025
- Published by Springer Nature
- p. 39-74
Guarding the Signal: Secure Messaging with Reverse Firewalls
- Open Access
- 15 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1638-1647
Ideal Pseudorandom Codes
- 15 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1638-1647
Open AccessIdeal Pseudorandom Codes
- 10 May 2025
- Published by Springer Nature
- p. 2419-2425
Signcryption
- 28 April 2025
- Published by Springer Nature
- p. 302-331
Triple Ratchet: A Bandwidth Efficient Hybrid-Secure Signal Protocol
- 28 April 2025
- Published by Springer Nature
- p. 302-331
Triple Ratchet: A Bandwidth Efficient Hybrid-Secure Signal Protocol
- Open Access
- 13 January 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (4)
HELP: Everlasting Privacy through Server-Aided Randomness
Everlasting (EL) privacy offers an attractive solution to the Store-Now-Decrypt-Later (SNDL) problem, where future increases in the attacker's capability could break systems which are believed to be secure today. Instead of requiring full information-theoretic security, everlasting privacy allows computationally-secure transmissions of ephemeral secrets, which are only "effective" for a limited periods of time, after which their compromise is provably useless for the SNDL attacker. In this work we revisit such everlasting privacy model of Dodis and Yeo (ITC'21), which we call Hypervisor EverLasting Privacy (HELP). HELP is a novel architecture for generating shared randomness using a network of semi-trusted servers (or "hypervisors"), trading the need to store/distribute large shared secrets with the assumptions that it is hard to: (a) simultaneously compromise too many publicly accessible ad-hoc servers; and (b) break a computationally-secure encryption scheme very quickly. While Dodis and Yeo presented good HELP solutions in the asymptotic sense, their solutions were concretely expensive and used heavy tools (like large finite fields or gigantic Toeplitz matrices). We abstract and generalize the HELP architecture to allow for more efficient instantiations, and construct several concretely efficient HELP solutions. Our solutions use elementary cryptographic operations, such as hashing and message authentication. We also prove a very strong composition theorem showing that our EL architecture can use any message transmission method which is computationally-secure in the Universal Composability (UC) framework. This is the first positive composition result for everlasting privacy, which was otherwise known to suffer from many "non-composition" results (Müller-Quade and Unruh; J of Cryptology'10).
- 13 January 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (4)
Open AccessHELP: Everlasting Privacy through Server-Aided Randomness
Everlasting (EL) privacy offers an attractive solution to the Store-Now-Decrypt-Later (SNDL) problem, where future increases in the attacker's capability could break systems which are believed to be secure today. Instead of requiring full information-theoretic security, everlasting privacy allows computationally-secure transmissions of ephemeral secrets, which are only "effective" for a limited periods of time, after which their compromise is provably useless for the SNDL attacker. In this work we revisit such everlasting privacy model of Dodis and Yeo (ITC'21), which we call Hypervisor EverLasting Privacy (HELP). HELP is a novel architecture for generating shared randomness using a network of semi-trusted servers (or "hypervisors"), trading the need to store/distribute large shared secrets with the assumptions that it is hard to: (a) simultaneously compromise too many publicly accessible ad-hoc servers; and (b) break a computationally-secure encryption scheme very quickly. While Dodis and Yeo presented good HELP solutions in the asymptotic sense, their solutions were concretely expensive and used heavy tools (like large finite fields or gigantic Toeplitz matrices). We abstract and generalize the HELP architecture to allow for more efficient instantiations, and construct several concretely efficient HELP solutions. Our solutions use elementary cryptographic operations, such as hashing and message authentication. We also prove a very strong composition theorem showing that our EL architecture can use any message transmission method which is computationally-secure in the Universal Composability (UC) framework. This is the first positive composition result for everlasting privacy, which was otherwise known to suffer from many "non-composition" results (Müller-Quade and Unruh; J of Cryptology'10).