Chris Peikert

Citado por

	Total	Desde 2019
Citas	24173	13225
Índice h	55	44
Índice i10	77	70

2500

1250

625

1875

20082009201020112012201320142015201620172018201920202021202220232024127 243 345 479 673 810 1156 1350 1579 1782 2137 2175 2247 2227 2316 2489 1766

Acceso público

Ver todo

30 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Vadim LyubashevskyIBM Research Europe, ZurichDirección de correo verificada de zurich.ibm.com
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyDirección de correo verificada de csail.mit.edu
Craig GentryCTO TripleBlindDirección de correo verificada de tripleblind.ai
Daniele MicciancioProfessor of Computer Science, University of California San DiegoDirección de correo verificada de cs.ucsd.edu
Oded RegevProfessor of Computer ScienceDirección de correo verificada de cims.nyu.edu
Alon RosenBocconi UniversityDirección de correo verificada de unibocconi.it
Brent WatersUniversity of Texas at AustinDirección de correo verificada de cs.utexas.edu
Abhishek BanerjeeGeorgia Institute of TechnologyDirección de correo verificada de cc.gatech.edu
David CashUniversity of ChicagoDirección de correo verificada de cs.uchicago.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLADirección de correo verificada de cs.ucla.edu
Daniel SanchezMassachusetts Institute of TechnologyDirección de correo verificada de csail.mit.edu
Nikola SamardzicMassachusetts Institute of TechnologyDirección de correo verificada de mit.edu
Aleksandar KrastevMITDirección de correo verificada de csail.mit.edu
Sina ShiehianSnap Inc.Dirección de correo verificada de umich.edu
Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumDirección de correo verificada de rub.de
Jacob Alperin-SheriffGeorgia Institute of TechnologyDirección de correo verificada de gatech.edu
Srinivas DevadasEdwin Sibley Webster Professor of Electrical Engineering and Computer Science, MITDirección de correo verificada de mit.edu
Axel FeldmannPhD student, MITDirección de correo verificada de csail.mit.edu
Léo DucasCWI, Amsterdam & Leiden University, The NetherlandsDirección de correo verificada de cwi.nl
abhi shelatProfessor of Computer ScienceDirección de correo verificada de neu.edu

Seguir

Chris Peikert

Professor, Computer Science and Engineering, University of Michigan

Dirección de correo verificada de alum.mit.edu - Página principal

Cryptography


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Trapdoors for hard lattices and new cryptographic constructions C Gentry, C Peikert, V Vaikuntanathan Proceedings of the fortieth annual ACM symposium on Theory of computing, 197-206, 2008	2970	2008
On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010	2376	2010
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	1443	2012
Public-key cryptosystems from the worst-case shortest vector problem C Peikert Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	1203	2009
Bonsai trees, or how to delegate a lattice basis D Cash, D Hofheinz, E Kiltz, C Peikert Journal of cryptology 25, 601-639, 2012	1116	2012
Better key sizes (and attacks) for LWE-based encryption R Lindner, C Peikert Topics in Cryptology–CT-RSA 2011: The Cryptographers’ Track at the RSA …, 2011	964	2011
A framework for efficient and composable oblivious transfer C Peikert, V Vaikuntanathan, B Waters Annual international cryptology conference, 554-571, 2008	890	2008
On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Journal of the ACM (JACM) 60 (6), 1-35, 2013	855	2013
Classical hardness of learning with errors Z Brakerski, A Langlois, C Peikert, O Regev, D Stehlé Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	825	2013
Fast cryptographic primitives and circular-secure encryption based on hard learning problems B Applebaum, D Cash, C Peikert, A Sahai Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009	787	2009
Lossy trapdoor functions and their applications C Peikert, B Waters Proceedings of the fortieth annual ACM symposium on Theory of computing, 187-196, 2008	760	2008
A decade of lattice cryptography C Peikert Foundations and trends® in theoretical computer science 10 (4), 283-424, 2016	707	2016
Pseudorandom functions and lattices A Banerjee, C Peikert, A Rosen Annual International Conference on the Theory and Applications of …, 2012	621	2012
A toolkit for ring-LWE cryptography V Lyubashevsky, C Peikert, O Regev Annual international conference on the theory and applications of …, 2013	552	2013
Lattice cryptography for the internet C Peikert International workshop on post-quantum cryptography, 197-219, 2014	513	2014
An efficient and parallel Gaussian sampler for lattices C Peikert Annual Cryptology Conference, 80-97, 2010	462	2010
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual cryptology conference, 21-39, 2013	407	2013
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices C Peikert, A Rosen Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006 …, 2006	397	2006
Faster bootstrapping with polynomial error J Alperin-Sheriff, C Peikert Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014	393	2014
Generating shorter bases for hard random lattices J Alwen, C Peikert Theory of Computing Systems 48, 535-553, 2011	367	2011

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores