R
Rachel Player
Researcher at Royal Holloway, University of London
Publications - 28
Citations - 1396
Rachel Player is an academic researcher from Royal Holloway, University of London. The author has contributed to research in topics: Encryption & Homomorphic encryption. The author has an hindex of 10, co-authored 22 publications receiving 1110 citations. Previous affiliations of Rachel Player include University of Paris.
Papers
More filters
Journal ArticleDOI
On the concrete hardness of Learning with Errors
TL;DR: In this article, the authors present hardness results for concrete instances of LWE and give concrete estimates for various families of instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the Learning with Errors problem.
Posted Content
On the concrete hardness of Learning with Errors.
TL;DR: In this article, the authors present hardness results for concrete instances of LWE and give concrete estimates for various families of instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the Learning with Errors problem.
Book ChapterDOI
Simple Encrypted Arithmetic Library - SEAL v2.1
Hao Chen,Kim Laine,Rachel Player +2 more
TL;DR: The most recent version (v2.1) of Simple Encrypted Arithmetic Library - SEAL, a homomorphic encryption library developed by Microsoft Research, and describe some of its core functionality as discussed by the authors.
Posted Content
Simple Encrypted Arithmetic Library - SEAL v2.1.
Hao Chen,Kim Laine,Rachel Player +2 more
TL;DR: The most recent version (v2.1) of Simple Encrypted Arithmetic Library - SEAL, a homomorphic encryption library developed by Microsoft Research, and describe some of its core functionality.
Book ChapterDOI
Estimate All the {LWE, NTRU} Schemes!
Martin R. Albrecht,Benjamin R. Curtis,Amit Deo,Alex Davidson,Rachel Player,Rachel Player,Eamonn W. Postlethwaite,Fernando Virdia,Thomas Wunderer +8 more
TL;DR: In this paper, the authors investigated the impact of different estimates for the asymptotic runtime of lattice reduction on the predicted security of LWE-and NTRU-based encryption, key encapsulation, and digital signature schemes.