Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Authors:
- Sergey GorbunovSGSergey Gorbunov
- Vinod VaikuntanathanVVVinod Vaikuntanathan
Top Cited Papers
Open Access
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 533-556
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys2013
- Functional Encryption for Threshold Functions (or Fuzzy IBE) from LatticesLecture Notes in Computer Science, 2012
- Functional Encryption for Inner Product Predicates from Learning with Errors2011
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts2011
- Efficient Selective Identity-Based Encryption Without Random OraclesJournal of Cryptology, 2010
- Generating Shorter Bases for Hard Random LatticesTheory of Computing Systems, 2010
- Efficient Lattice (H)IBE in the Standard Model2010
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys2005
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- Generating Hard Instances of the Short Basis Problem1999