New Obfuscation Scheme for Conjunctions
- 19 September 2022
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (11), 2773-2781
- https://doi.org/10.1093/comjnl/bxac120
Abstract
Recently, there has been renewed interest in conjunction obfuscations. A conjunction, which is called pattern matching with wildcards sometimes, is associated with a pattern |$\mathsf{pat}\in \{0,1,*\}^n$| where * is a wildcard. It accepts if and only if the input bits are the same as the pattern at all non-wildcard positions. The conjunction obfuscation starts to get noticed because it provides the ability to protect these sensitive patterns while preserving its functionality. It is meaningful when the conjunction obfuscation is applied in the pattern matching, biological recognition, resisting SQL injection attacks and so on. In this work, we propose a new candidate of conjunction obfuscation. It not only retains the simplicity of the intuitive scheme in BKM18, but also adds wildcards to the pattern. Besides, we also propose a conjunction obfuscation with multi-bit output. The second obfuscation has the same size of the obfuscated program as the first obfuscation. Both obfuscations provide the distributional virtual black-box security.Keywords
Funding Information
- Guangdong Major Project of Basic and Applied Basic Research (2019B030302008)
- National Natural Science Foundation of China (61972429)
This publication has 19 references indexed in Scilit:
- Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its ApplicationsAlgorithmica, 2016
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability ObfuscationAlgorithmica, 2016
- Obfuscating Conjunctions under Entropic Ring LWEPublished by Association for Computing Machinery (ACM) ,2016
- Indistinguishability Obfuscation from Functional EncryptionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2015
- Indistinguishability Obfuscation from Compact Functional EncryptionPublished by Springer Science and Business Media LLC ,2015
- How to use indistinguishability obfuscationPublished by Association for Computing Machinery (ACM) ,2014
- Obfuscating ConjunctionsPublished by Springer Science and Business Media LLC ,2013
- PseudorandomnessFoundations and Trends® in Theoretical Computer Science, 2012
- Randomness is Linear in SpaceJournal of Computer and System Sciences, 1996
- The Pjateckiĭ-S̆apiro prime number theoremJournal of Number Theory, 1983