Anand Desai

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:83/2162 · DBLP profile ↗

← Back

7ranked-venue papers

4as first author

0since 2021 · last 2002

0009-0003-3509-7658ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 4 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security

7 papers

Cryptographic primitives and cryptanalysis · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography public-key encryption	0.1	2	2001	Key-Privacy in Public-Key Encryption · ASIACRYPT 2001 Relations Among Notions of Security for Public-Key Encryption Schemes · CRYPTO 1998
Cryptographic primitives and cryptanalysis › provable security concrete security	0.0	2	2000	Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications · ASIACRYPT 2000 A Concrete Security Treatment of Symmetric Encryption · FOCS 1997
Cryptographic primitives and cryptanalysis symmetric cryptography	0.0	2	2000	New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack · CRYPTO 2000 A Concrete Security Treatment of Symmetric Encryption · FOCS 1997
Cryptographic primitives and cryptanalysis pseudorandom generators	0.0	1	2002	A Practice-Oriented Treatment of Pseudorandom Number Generators · EUROCRYPT 2002
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption chosen-ciphertext security	0.0	1	2000	New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack · CRYPTO 2000
Cryptographic primitives and cryptanalysis pseudorandom functions	0.0	1	2000	Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications · ASIACRYPT 2000
Cryptographic primitives and cryptanalysis › pseudorandomness pseudorandom permutations	0.0	1	2000	Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications · ASIACRYPT 2000
Cryptographic primitives and cryptanalysis › provable security security notions	0.0	1	1998	Relations Among Notions of Security for Public-Key Encryption Schemes · CRYPTO 1998
Cryptographic primitives and cryptanalysis › block cipher block cipher modes	0.0	1	1997	A Concrete Security Treatment of Symmetric Encryption · FOCS 1997
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models chosen-plaintext attack	0.0	1	1997	A Concrete Security Treatment of Symmetric Encryption · FOCS 1997

Methods — techniques the papers use, named apart from their topics

reduction · 0.1pseudorandomness · 0.0cryptographic security analysis · 0.0provable security · 0.0concrete complexity analysis · 0.0

Year	Publication	Venue	Position
2002	A Practice-Oriented Treatment of Pseudorandom Number Generators Anand Desai, Alejandro Hevia, Yiqun Lisa Yin	EUROCRYPT	1
2001	Key-Privacy in Public-Key Encryption Mihir Bellare, Alexandra Boldyreva, Anand Desai, David Pointcheval	ASIACRYPT	3
2000	Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications Anand Desai, Sara Miner More	ASIACRYPT	1
2000	The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search Anand Desai	CRYPTO	1
2000	New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack Anand Desai	CRYPTO	1
1998	Relations Among Notions of Security for Public-Key Encryption Schemes Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway	CRYPTO	2
1997	A Concrete Security Treatment of Symmetric Encryption abstract We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four different notions of security against chosen plaintext attack and analyze the concrete complexity of reductions among them, providing both upper and lower bounds, and obtaining tight relations. In this way we classify notions (even though polynomially reducible to each other) as stronger or weaker in terms of concrete security. Next we provide concrete security analyses of methods to encrypt using a block cipher, including the most popular encryption method, CBC. We establish tight bounds (meaning matching upper bounds and attacks) on the success of adversaries as a function of their resources. Mihir Bellare, Anand Desai, E. Jokipii, Phillip Rogaway	FOCS	2