All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
- 2 August 2017
- book chapter
- Published by Springer Nature
- p. 332-364
Abstract
No abstract availableKeywords
This publication has 72 references indexed in Scilit:
- Discrete Gaussian Leftover Hash Lemma over Infinite Domains2013
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- Learning with Rounding, Revisited2013
- Key Homomorphic PRFs and Their Applications2013
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions2013
- Circular Chosen-Ciphertext Security with Compact Ciphertexts2013
- More Constructions of Lossy and Correlation-Secure Trapdoor FunctionsJournal of Cryptology, 2011
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- Magic FunctionsJournal of the ACM, 2003
- Probabilistic encryptionJournal of Computer and System Sciences, 1984