• What's new
• Archive
• Paper awards
• Videos
• Authors
• Coauthors
• By year
• By venue
• All Committees
• Most Committees
• Report errors
• About

Stefano Tessaro  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2018	Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds	eurocrypt	468-499
2	2018	Naor-Reingold Goes Public: The Complexity of Known-Key Security	eurocrypt	653-684
3	2018	The Curse of Small Domains: New Attacks on Format-Preserving Encryption	crypto	221-251
4	2018	Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries	tcc	3-32
5	2017	Scrypt Is Maximally Memory-Hard	eurocrypt	33-62
6	2017	Public-Seed Pseudorandom Permutations	eurocrypt	412-441
7	2017	The Multi-user Security of Double Encryption	eurocrypt	381-411
8	2017	Information-Theoretic Indistinguishability via the Chi-Squared Method	crypto	497-523
9	2017	Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs	crypto	630-660
10	2016	On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model	eurocrypt	online
11	2016	Provably Robust Sponge-Based PRNGs and KDFs	eurocrypt	online
12	2016	Hash-Function Based PRFs: AMAC and Its Multi-User Security	eurocrypt	online
13	2016	Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security	crypto	3-32
14	2016	Contention in Cryptoland: Obfuscation, Leakage and UCE	tcc	online
15	2016	Oblivious Parallel RAM: Improved Efficiency and Generic Constructions	tcc	online
16	2016	Two-Round Man-in-the-Middle Security from LPN	tcc	online
17	2016	Simultaneous Secrecy and Reliability Amplification for a General Channel Model	tcc	235-261
18	2016	How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction	jofc	61-114
19	2015	Tight Bounds for Keyed Sponges and Truncated CBC	eprint	53
20	2015	Oblivious Parallel RAM: Improved Efficiency and Generic Constructions	eprint	1053
21	2015	Contention in Cryptoland: Obfuscation, Leakage and UCE	eprint	487
22	2015	Optimally Secure Block Ciphers from Ideal Primitives	eprint	868
23	2015	Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes	eprint	397
24	2015	Generic Security of NMAC and HMAC with Input Whitening	eprint	881
25	2015	Obfuscation of Probabilistic Circuits and Applications	tcc	online
26	2015	Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes	fse	online
27	2015	The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC	crypto	online
28	2015	Generic Security of NMAC and HMAC with Input Whitening	asiacrypt	online
29	2015	Optimally Secure Block Ciphers from Ideal Primitives	asiacrypt	online
30	2014	The Locality of Searchable Symmetric Encryption	eurocrypt	online
31	2014	Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts	pkc	online
32	2014	The Locality of Searchable Symmetric Encryption	eprint	308
33	2014	Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts	eprint	61
34	2014	Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation	asiacrypt	online
35	2013	Communication Locality in Secure Multi-Party Computation: How to Run Sublinear Algorithms in a Distributed Setting	TCC	online
36	2013	Amplification of Chosen-Ciphertext Security	eurocrypt	online
37	2012	Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading	eurocrypt	online
38	2012	Semantic Security for the Wiretap Channel	crypto	online
39	2012	To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC	crypto	online
40	2012	Multi-instance Security and Its Application to Password-Based Cryptography	crypto	online
41	2011	Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma	tcc	online
42	2010	A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch	tcc	online
43	2010	Random Oracles with(out) Programmability	asiacrypt	online
44	2009	A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical	asiacrypt	online
45	2009	Computational Indistinguishability Amplification: Tight Product Theorems for System Composition	crypto	online
46	2008	Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography	asiacrypt	online
47	2007	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	crypto	online
48	2007	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	eprint	online

Coauthors of Stefano Tessaro

1. Joël Alwen (2)
2. Mihir Bellare (6)
3. Daniel J. Bernstein (1)
4. Priyanka Bose (1)
5. Elette Boyle (1)
6. Ran Canetti (1)
7. David Cash (3)
8. Binyi Chen (4)
9. Jean-Sébastien Coron (1)
10. Wei Dai (1)
11. Yevgeniy Dodis (1)
12. Marc Fischlin (1)
13. Peter Gaži (8)
14. Shafi Goldwasser (1)
15. Viet Tung Hoang (5)
16. Thomas Holenstein (1)
17. Russell Impagliazzo (1)
18. Ragesh Jaiswal (1)
19. Valentine Kabanets (1)
20. Chethan Kamath (1)
21. Bruce M. Kapron (1)
22. Eike Kiltz (1)
23. Valerie King (1)
24. Vladimir Kolmogorov (1)
25. Robin Künzler (1)
26. Jooyoung Lee (2)
27. Anja Lehmann (2)
28. Huijia Lin (5)
29. Ueli Maurer (5)
30. Jacques Patarin (1)
31. Krzysztof Pietrzak (6)
32. Leonid Reyzin (1)
33. Thomas Ristenpart (3)
34. Yannick Seurin (3)
35. Thomas Shrimpton (1)
36. Pratik Soni (2)
37. Martijn Stam (1)
38. John P. Steinberger (3)
39. Igors Stepanovs (3)
40. Aishwarya Thiruvengadam (1)
41. Ni Trieu (1)
42. Vinod Vaikuntanathan (1)
43. Alexander Vardy (1)
44. David A. Wilson (2)