Advances in Cryptology – CRYPTO 2017

@inproceedings{Katz2017AdvancesIC,
  title={Advances in Cryptology – CRYPTO 2017},
  author={Jonathan Katz and Hovav Shacham},
  booktitle={Lecture Notes in Computer Science},
  year={2017}
}
We construct a functional encryption scheme for circuits which simultaneously achieves and improves upon the security of the current best known, and incomparable, constructions from standard assumptions: reusable garbled circuits by Goldwasser, Kalai, Popa, Vaikuntanathan and Zeldovich (STOC 2013) [GKP+13] and predicate encryption for circuits by Gorbunov, Vaikuntanathan and Wee (CRYPTO 2015) [GVW15]. Our scheme is secure based on the learning with errors (LWE) assumption. Our construction… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 61 REFERENCES

Oblivious Multi-variate Polynomial Evaluation

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

On the Portability of Generalized Schnorr Proofs

  • IACR Cryptology ePrint Archive
  • 2009
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL