GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
© 2018, International Association for Cryptologic Research. We carry out a systematic study of the GGH15 graded encoding scheme used with general branching programs. This is motivated by the fact that general branching programs are more efficient than permutation branching programs and also substant...
Main Authors: | Chen, Yilei, Vaikuntanathan, Vinod, Wee, Hoeteck |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer International Publishing
2021
|
Online Access: | https://hdl.handle.net/1721.1/137867 |
Similar Items
-
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation
by: Chen, Yilei, et al.
Published: (2021) -
The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
by: Arif Mandangan, et al.
Published: (2023) -
The efficiency of embedding-based attacks on the GGH lattice-based cryptosystem
by: Mandangan,, A., et al.
Published: (2023) -
Conditional Disclosure of Secrets via Non-linear Reconstruction
by: Liu, Tianren, et al.
Published: (2021) -
Predicate Encryption for Circuits from LWE
by: Gorbunov, Sergey, et al.
Published: (2017)