Obfuscating circuits via composite-order graded encoding

DOI10.1007/S00145-021-09378-ZzbMath1467.94025OpenAlexW3155111802MaRDI QIDQ2039401

Zvika Brakerski, Benny Applebaum

Publication date: 2 July 2021

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.691.7004

zbMATH Keywords

algebraic securityGES oracle

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Obfustopia built on secret-key functional encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Practical Multilinear Maps over the Integers
• Obfuscating Conjunctions
• Witness Encryption from Instance Independent Assumptions
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• Bootstrapping Obfuscators via Fast Pseudorandom Functions
• How to Obfuscate Programs Directly
• Black-box obfuscation for d-CNFs
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Candidate Multilinear Maps from Ideal Lattices
• Protecting Obfuscation against Algebraic Attacks
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Cryptography and Coding

This page was built for publication: Obfuscating circuits via composite-order graded encoding