More Efficient Universal Circuit Constructions-Reference-Cited by-同舟云学术

More Efficient Universal Circuit Constructions

Published:2017 Issue: Volume: Page:443-470
ISSN:0302-9743
Container-title:Advances in Cryptology – ASIACRYPT 2017
language:
Short-container-title:

Author:

Günther Daniel,Kiss Ágnes,Schneider Thomas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70697-9_16

Reference42 articles.

1. Lecture Notes in Computer Science;A Afshar,2014

2. Attrapadung, N.: Fully secure and succinct attribute based encryption for circuits from multi-linear maps. Cryptology ePrint Archive, Report 2014/772 (2014). http://ia.cr/2014/772

3. Bicer, O., Bingol, M.A., Kiraz, M.S., Levi, A.: Towards practical PFE: an efficient 2-party private function evaluation protocol based on half gates. Cryptology ePrint Archive, Report 2017/415 (2017). http://ia.cr/2017/415

4. Beauquier, B., Darrot, É.: On arbitrary size Waksman networks and their vulnerability. Parallel Proces. Lett. 12(3–4), 287–296 (2002)

5. Lecture Notes in Computer Science;M Barni,2009

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PFE: Linear Active Security, Double-Shuffle Proofs, and Low-Complexity Communication;Lecture Notes in Computer Science;2024

2. Breaking the Size Barrier: Universal Circuits Meet Lookup Tables;Advances in Cryptology – ASIACRYPT 2023;2023

3. Generic 2-Party PFE with Constant Rounds and Linear Active Security, and Efficient Instantiation;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2023

4. Constant-Round Multiparty Private Function Evaluation with (Quasi-)Linear Complexities;Applied Cryptography and Network Security;2023

5. Private Function Evaluation with Cards;New Generation Computing;2022-02-12