i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Authors:
Open Access
- 1 January 2010
- book chapter
- Published by Springer Nature
- Vol. 2010, 155-172
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Bounded Key-Dependent Message Security2010
- Additively Homomorphic Encryption with d-Operand Multiplications2010
- Fully homomorphic encryption using ideal lattices2009
- A Proof of Security of Yao’s Protocol for Two-Party ComputationJournal of Cryptology, 2008
- Circular-Secure Encryption from Decision Diffie-Hellman2008
- Evaluating Branching Programs on Encrypted Data2007
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data2004
- Priced Oblivious Transfer: How to Sell Digital Goods2001
- One-Round Secure Computation and Secure Autonomous Mobile AgentsLecture Notes in Computer Science, 2000
- Probabilistic encryptionJournal of Computer and System Sciences, 1984