Daniele Micciancio

International Association for Cryptologic Research

Daniele Micciancio Search web for home page

Program Committees

1	2013	Eurocrypt	pc
2	2012	Crypto	pc
3	2012	TCC	pc
4	2011	Crypto	pc
5	2010	TCC	pc chair
6	2009	TCC	pc
7	2006	Crypto	pc
8	2006	TCC	pc
9	2004	Eurocrypt	pc
10	2004	Crypto	pc
11	2004	TCC	pc

Publications

	year	title	booktitle	pages
1	2012	Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller	eurocrypt	700-718
2	2011	Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions	crypto	461
3	2010	The RSA Group is Pseudo-Free	jofc	169-186
4	2010	Computational Soundness, Co-induction, and Encryption Cycles	eurocrypt	362-380
5	2009	On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem	crypto	577-594
6	2008	SWIFFT: A Modest Proposal for FFT Hashing	fse	online
7	2008	The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization	tcc	535-552
8	2008	Asymptotically Efficient Lattice-Based Digital Signatures	tcc	37-54
9	2006	Concurrent Zero Knowledge Without Complexity Assumptions	tcc	online
10	2005	Concurrent Zero Knowledge without Complexity Assumptions	eprint	online
11	2005	The RSA Group is Pseudo-Free	eurocrypt	online
12	2005	Adaptive Security of Symbolic Encryption	tcc	online
13	2004	Soundness of Formal Encryption in the Presence of Active Adversaries	tcc	133-151
14	2004	Optimal Communication Complexity of Generic Multicast Key Distribution	eurocrypt	online
15	2004	Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions	eprint	online
16	2003	Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions	eurocrypt	614-629
17	2003	Simulatable Commitments and Efficient Concurrent Zero-Knowledge	eurocrypt	online
18	2003	Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More	crypto	online
19	2002	Cryptanalysis of a Pseudorandom Generator Based on Braid Groups	eurocrypt	online
20	2002	The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes	asiacrypt	online
21	2002	Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods	eurocrypt	online
22	2002	Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol	eprint	online
23	2001	Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures	eprint	online
24	1999	Lattice Based Cryptography: A Global Improvement	eprint	online
25	1998	An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products	eprint	online
26	1997	A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost	eprint	online
27	1997	A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost	eurocrypt	163-192
28	1997	"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case	crypto	277-291

Daniele Micciancio Search web for home page

Program Committees

Publications

Coauthors of Daniele Micciancio