Travelled to:1 × Canada
3 × USA
Collaborated with:∅ B.Waters A.Rosen C.Gentry V.Vaikuntanathan Z.Brakerski A.Langlois O.Regev D.Stehlé
Talks about:case (3) trapdoor (2) lattic (2) worst (2) hard (2) cryptosystem (1) cryptograph (1) logarithm (1) construct (1) shortest (1)
Person: Chris Peikert
DBLP: Peikert:Chris
Contributed to:
2013200920082007Wrote 5 papers:
- STOC-2013-BrakerskiLPRS #fault #learning
- Classical hardness of learning with errors (ZB, AL, CP, OR, DS), pp. 575–584.
- STOC-2009-Peikert #problem #worst-case
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (CP), pp. 333–342.
- STOC-2008-GentryPV #encryption
- Trapdoors for hard lattices and new cryptographic constructions (CG, CP, VV), pp. 197–206.
- STOC-2008-PeikertW
- Lossy trapdoor functions and their applications (CP, BW), pp. 187–196.
- STOC-2007-PeikertR #worst-case
- Lattices that admit logarithmic worst-case to average-case connection factors (CP, AR), pp. 478–487.