Public-key cryptosystems from the worst-case shortest vector problem
- 31 May 2009
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Chosen-Ciphertext Security via Correlated ProductsLecture Notes in Computer Science, 2009
- A Framework for Efficient and Composable Oblivious TransferLecture Notes in Computer Science, 2008
- Limits on the Hardness of Lattice Problems in ℓ p Normscomputational complexity, 2008
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- New lattice-based cryptographic constructionsJournal of the ACM, 2004
- On the Limits of Nonapproximability of Lattice ProblemsJournal of Computer and System Sciences, 2000
- A relation of primal-dual lattices and the complexity of shortest lattice vector problemTheoretical Computer Science, 1998
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982