Petros Mol

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2011
c4		Daniele Micciancio, Petros Mol: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. CRYPTO 2011: 465-484
c3		Petros Mol, Andrea Vattani, Panagiotis Voulgaris: The Effects of Diversity in Aggregation Games. ICS 2011: 509-521
i2		Daniele Micciancio, Petros Mol: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. IACR Cryptology ePrint Archive 2011: 521 (2011)
	2010
c2		Petros Mol, Scott Yilek: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. Public Key Cryptography 2010: 296-311
	2009
i1		Petros Mol, Scott Yilek: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. IACR Cryptology ePrint Archive 2009: 524 (2009)
	2008
c1		Petros Mol, Moti Yung: Recovering NTRU Secret Key from Inversion Oracles. Public Key Cryptography 2008: 18-36

Coauthor Index

Last update Sun May 19 04:37:44 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page