搜索结果: 1-15 共查到“军队指挥学 Obfuscation”相关记录157条 . 查询时间(0.108 秒)
Hardware-Software Co-Design Based Obfuscation of Hardware Accelerators
hardware security logic obfuscation hardware accelerator
font style='font-size:12px;'>
2019/9/19
Existing logic obfuscation approaches aim to protect hardware design IPs from SAT attack by increasing query count and output corruptibility of a locked netlist. In this paper, we demonstrate the inef...
On Perfect Correctness in (Lockable) Obfuscation
Obfuscation Lockable Obfuscation Perfect Correctness
font style='font-size:12px;'>
2019/9/16
In a lockable obfuscation scheme a party takes as input a program PP, a lock value αα, a message mm and produces an obfuscated program P~P~. The obfuscated program can be evaluated on an input xx to l...
Blockchain-enabled Cryptographically-secure Hardware Obfuscation
IP Piracy Logic Locking Hardware Obfuscation
font style='font-size:12px;'>
2019/8/19
Electronic chips in consumer, industrial, and military applications are targeted by untrusted entities in the design and fabrication process, aiming at reverse-engineering and Intellectual Property (I...
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
PFG iO
font style='font-size:12px;'>
2019/6/4
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
In Pursuit of Clarity In Obfuscation
research efforts cryptographic obfuscation
font style='font-size:12px;'>
2019/5/13
The messy birth of multilinear maps in the paper “Candidate Multilinear Maps from Ideal Lattices”by Garg, Gentry, and Halevi [GGH13a] appeared to some elements of the cryptographic research community ...
Dual-Mode NIZKs from Obfuscation
non-interactive zero-knowledge dual-mode proof systems indistinguishability obfuscation
font style='font-size:12px;'>
2019/5/13
Two standard security properties of a non-interactive zero-knowledge (NIZK) scheme are soundness and zero-knowledge. But while standard NIZK systems can only provide one of those properties against un...
Chaotic Compilation for Encrypted Computing: Obfuscation but Not in Name
Encrypted computing Compilers Obfuscation
font style='font-size:12px;'>
2019/4/28
An `obfuscation' for the encrypted computing context is quantified exactly here, leading to an argument that security against polynomial-time attacks has been achieved for user data, with or without e...
Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation
indistinguishability obfuscation functional encryption
font style='font-size:12px;'>
2019/3/21
Every known construction of general indistinguishability obfuscation (iOiO) is either based on a family of exponentially many assumptions, or is based on a single assumption -- e.g.~functional encrypt...
An Information Obfuscation Calculus for Encrypted Computing
Applications foundations information theory
font style='font-size:12px;'>
2019/1/29
Relative cryptographic semantic security for encrypted words of user data at runtime holds in the emerging field of encrypted computing, in conjunction with an appropriate instruction set and compiler...
Implementing Token-Based Obfuscation under (Ring) LWE
implementation lattice techniques token-based program obfuscation
font style='font-size:12px;'>
2019/1/2
Token-based obfuscation (TBO) is an interactive approach to cryptographic program obfuscation that was proposed by Goldwasser et al. as a potentially more practical alternative to conventional non-int...
Sum-of-Squares Meets Program Obfuscation, Revisited
Sum-of-Squares Indistinguishability Obfuscation
font style='font-size:12px;'>
2019/1/2
We develop attacks on the security of variants of pseudo-random generators computed by quadratic polynomials. In particular we give a general condition for breaking the one-way property of mappings wh...
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map
Cryptanalysis indistinguishability obfuscation multilinear map
font style='font-size:12px;'>
2018/11/12
We introduce a new type of cryptanalytic algorithm on the obfuscations based on the branching programs. Applying this algorithm to two recent general-purpose obfuscation schemes one by Chen et al. (CR...
Candidate Differing-Inputs Obfuscation from Indistinguishability Obfuscation and Auxiliary-Input Point Obfuscation
Indistinguishability Obfuscation Auxiliary-Input Point Obfuscation
font style='font-size:12px;'>
2018/11/2
Differing-inputs obfuscation (diO), first proposed by Barak et. al. [4], provides stronger security than that provided by indistinguishability obfuscation (iO). An iO scheme provides indistinguishabil...
Obfuscation Using Tensor Products
Tensor Products Multilinear Maps
font style='font-size:12px;'>
2018/8/21
We describe obfuscation schemes for matrix-product branching programs that are purely algebraic and employ matrix algebra and tensor algebra over a finite field. In contrast to the obfuscation schemes...
Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation
indistinguishability obfuscation functional encryption pseudo-randomness
font style='font-size:12px;'>
2018/7/9
We construct indistinguishability obfuscation from subexponentially secure Learning With Errors (LWE), bilinear maps, a constant-locality Pseudo Random Generator (PRG), and a new tool called Pseudo Fl...