Yevgeniy Dodis

From MaRDI portal
Person:1648792

Available identifiers

zbMath Open dodis.yevgeniyDBLPd/YevgeniyDodisWikidataQ102300355 ScholiaQ102300355MaRDI QIDQ1648792

List of research outcomes





PublicationDate of PublicationType
Compact key storage. A modern approach to key backup and delegation2024-12-04Paper
Security with functional re-encryption from CPA2024-08-02Paper
Immunizing backdoored PRGs2024-08-02Paper
On seedless PRNGs and premature next2024-06-25Paper
Revisiting collision and local opening analysis of ABR hash2024-06-25Paper
https://portal.mardi4nfdi.de/entity/Q61262892024-04-09Paper
Speak much, remember little: cryptography in the bounded storage model, revisited2024-01-16Paper
On the worst-case inefficiency of CGKA2023-08-14Paper
Forward-secure encryption with fast forwarding2023-08-14Paper
Encapsulated search index: public-key, sub-linear, distributed, and delegatable2023-08-10Paper
https://portal.mardi4nfdi.de/entity/Q61072642023-07-03Paper
Online Linear Extractors for Independent Sources2023-07-03Paper
T5: Hashing five inputs with three compression calls2023-07-03Paper
Forward secret encrypted RAM: lower bounds and applications2023-04-13Paper
Updatable public key encryption in the standard model2023-04-13Paper
Security analysis and improvements for the IETF MLS standard for group messaging2022-11-09Paper
Authentication in the bounded storage model2022-08-30Paper
Multicast key agreement, revisited2022-07-06Paper
No time to hash: on super-efficient entropy accumulation2022-05-18Paper
On the price of concurrency in group ratcheting protocols2022-03-23Paper
Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity2022-03-23Paper
Extracting randomness from extractor-dependent sources2021-12-01Paper
Unilaterally-Authenticated Key Exchange2021-03-17Paper
Non-malleable encryption: simpler, shorter, stronger2020-11-06Paper
Seedless fruit is the sweetest: random number generation, revisited2020-05-20Paper
Reusable non-interactive secure computation2020-03-09Paper
The double ratchet: security notions, proofs, and modularization for the Signal protocol2020-02-04Paper
Provable security of (tweakable) block ciphers based on substitution-permutation networks2018-09-12Paper
Fast message franking: from invisible salamanders to encryptment2018-09-12Paper
Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models2018-09-12Paper
Random oracles and non-uniformity2018-07-09Paper
Non-Malleable Codes from Additive Combinatorics2018-04-26Paper
How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs2018-01-05Paper
A new distribution-sensitive secure sketch and popularity-proportional hashing2017-10-27Paper
Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited2017-06-13Paper
Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines2016-11-30Paper
Spooky Encryption and Its Applications2016-11-09Paper
Design networks with bounded pairwise distance2016-09-29Paper
Indifferentiability of Confusion-Diffusion Networks2016-07-15Paper
Interactive Coding for Interactive Proofs2016-04-08Paper
Non-Malleable Encryption: Simpler, Shorter, Stronger2016-03-23Paper
Privacy with Imperfect Randomness2015-12-10Paper
A formal treatment of backdoored pseudorandom generators2015-09-30Paper
Scalable public-key tracing and revoking2015-09-04Paper
Non-malleable reductions and applications2015-08-21Paper
Non-malleable codes from additive combinatorics (extended abstract)2015-06-26Paper
On cryptography with auxiliary input2015-02-04Paper
Non-malleable extractors and symmetric key cryptography from weak secrets2015-02-04Paper
Interactive encryption and message authentication2014-10-14Paper
Changing base without losing space2014-08-13Paper
Amplifying Privacy in Privacy Amplification2014-08-07Paper
How to eat your entropy and have it too -- optimal recovery strategies for compromised RNGs2014-08-07Paper
Privacy Amplification and Nonmalleable Extractors Via Character Sums2014-07-30Paper
Key derivation without entropy waste2014-05-27Paper
On continual leakage of discrete log representations2013-12-10Paper
On the indifferentiability of key-alternating ciphers2013-09-02Paper
Bottleneck links, variable demand, and the tragedy of the commons2013-08-06Paper
Scalable public-key tracing and revoking2013-06-07Paper
Overcoming weak expectations2013-03-18Paper
Shannon impossibility, revisited2012-11-06Paper
Differential privacy with imperfect randomness2012-09-25Paper
To hash or not to hash again? (In)differentiability results for \(H^2\) and HMAC2012-09-25Paper
Message authentication, revisited2012-06-29Paper
Counterexamples to hardness amplification beyond negligible2012-06-15Paper
Randomness condensers for efficiently samplable, seed-dependent sources2012-06-15Paper
On the instantiability of hash-and-sign RSA signatures2012-06-15Paper
Leftover Hash Lemma, Revisited2011-08-12Paper
Domain extension for MACs beyond the birthday barrier2011-05-27Paper
Concealment and its applications to authenticated encryption2011-05-18Paper
Public key broadcast encryption for stateless receivers2011-03-18Paper
Efficient public-key cryptography in the presence of key leakage2010-12-07Paper
Survey: leakage resilience and the bounded retrieval model2010-09-29Paper
Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks2010-08-24Paper
Pricing network edges for heterogeneous selfish users2010-08-16Paper
Bottleneck links, variable demand, and the tragedy of the commons2010-08-16Paper
Public-key encryption in the bounded-retrieval model2010-06-01Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
Public-key encryption schemes with auxiliary inputs2010-02-24Paper
A domain extender for the ideal cipher2010-02-24Paper
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model2009-10-20Paper
Message Authentication Codes from Unpredictable Block Ciphers2009-10-20Paper
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD62009-08-11Paper
Salvaging Merkle-Damgård for Practical Applications2009-05-12Paper
Topics in Cryptology – CT-RSA 20042009-05-07Paper
Forward-secure hierarchical IBE with applications to broadcast encryption2009-03-24Paper
Proofs of Retrievability via Hardness Amplification2009-03-03Paper
Security Amplification for Interactive Cryptographic Primitives2009-03-03Paper
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs2009-02-10Paper
Improving the Security of MACs Via Randomized Message Preprocessing2008-09-16Paper
Cryptography and game theory2008-09-12Paper
Optimistic fair exchange in a multi-user setting2008-08-07Paper
Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?2008-06-13Paper
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors2008-04-15Paper
A New Mode of Operation for Block Ciphers and Length-Preserving MACs2008-04-15Paper
Merkle-Damgård Revisited: How to Construct a Hash Function2008-03-17Paper
On the Generic Insecurity of the Full Domain Hash2008-03-17Paper
Feistel Networks Made Public, and Applications2007-11-29Paper
Advances in Cryptology - EUROCRYPT 20042007-09-25Paper
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer2007-09-11Paper
Optimistic Fair Exchange in a Multi-user Setting2007-09-04Paper
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model2007-08-30Paper
Universally Composable Security with Global Setup2007-08-30Paper
Does Privacy Require True Randomness?2007-08-30Paper
Theory of Cryptography2007-02-12Paper
Theory of Cryptography2007-02-12Paper
Theory of Cryptography2007-02-12Paper
Theory of Cryptography2007-02-12Paper
How much can taxes help selfish routing?2006-06-30Paper
Exposure-resilient functions and all-or-nothing transforms2006-03-01Paper
Financial Cryptography and Data Security2005-12-22Paper
Theory of Cryptography2005-12-07Paper
Public Key Cryptography - PKC 20052005-12-07Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Advances in Cryptology – CRYPTO 20042005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q47372362004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47372372004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44348832003-11-26Paper
https://portal.mardi4nfdi.de/entity/Q44185242003-08-10Paper
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack2003-07-27Paper
Strong Key-Insulated Signature Schemes2003-07-27Paper
Efficient Construction of (Distributed) Verifiable Random Functions2003-07-27Paper
https://portal.mardi4nfdi.de/entity/Q44142682003-07-24Paper
Universal configurations in light-flipping games2003-02-06Paper
https://portal.mardi4nfdi.de/entity/Q47854652003-02-04Paper
https://portal.mardi4nfdi.de/entity/Q45367972002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45367952002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45350252002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q27788552002-03-21Paper
https://portal.mardi4nfdi.de/entity/Q42523982000-06-13Paper
https://portal.mardi4nfdi.de/entity/Q49418292000-03-19Paper
Lower Bounds for Oblivious Transfer Reductions2000-03-13Paper

Research outcomes over time

This page was built for person: Yevgeniy Dodis