Results 1 
4 of
4
Implementing cryptographic program obfuscation. Cryptology ePrint Archive, Report 2014/779
, 2014
"... Program obfuscation is the process of making a program “unintelligible ” without changing the program’s underlying input/output behavior. Although there is a long line of work on heuristic techniques for obfuscation, such approaches do not provide any cryptographic guarantee on their effectiveness. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Program obfuscation is the process of making a program “unintelligible ” without changing the program’s underlying input/output behavior. Although there is a long line of work on heuristic techniques for obfuscation, such approaches do not provide any cryptographic guarantee on their effectiveness. A recent result by Garg et al. (FOCS 2013), however, shows that cryptographic program obfuscation is indeed possible based on a new primitive called a graded encoding scheme. In this work, we present the first implementation of such an obfuscator. We describe several challenges and optimizations we made along the way, present a detailed evaluation of our implementation, and discuss research problems that need to be addressed before such obfuscators can be used in practice. 1
Idea: Benchmarking Indistinguishability Obfuscation – A candidate implementation
"... Abstract. We present the results of preliminary experiments implementing the Candidate Indistinguishability Obfuscation algorithm recently proposed by Garg et al. [1]. We show how different parameters of the input circuits impact the performance and the size of the obfuscated programs. On the nega ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present the results of preliminary experiments implementing the Candidate Indistinguishability Obfuscation algorithm recently proposed by Garg et al. [1]. We show how different parameters of the input circuits impact the performance and the size of the obfuscated programs. On the negative side, our benchmarks show that for the time being the algorithm is far away from being practical. On the positive side, there is still much room for improvement in our implementation. We discuss bottlenecks encountered and optimization possibilities. In order to foster further improvements by the community, we make our implementation public. 1
Multilinear Map via ScaleInvariant FHE: Enhancing Security and Efficiency
"... Abstract. Cryptographic multilinear map is a useful tool for constructing numerous secure protocols and Graded Encoding System (GES) is an approximate concept of multilinear map. In multilinear map context, there are several important issues, mainly about security and efficiency. All early stage can ..."
Abstract
 Add to MetaCart
Abstract. Cryptographic multilinear map is a useful tool for constructing numerous secure protocols and Graded Encoding System (GES) is an approximate concept of multilinear map. In multilinear map context, there are several important issues, mainly about security and efficiency. All early stage candidate multilinear maps are recently broken by socalled zeroizing attack, so that it is highly required to develop reliable mechanisms to prevent zeroizing attacks. Moreover, the encoding size in all candidate multilinear maps grows quadratically in terms of multilinearity parameter κ and it makes them less attractive for applications requiring large κ. In this paper, we propose a new integerbased multilinear map that has several advantages over previous schemes. In terms of security, we expect that our construction is resistant to the zeroizing attack. In terms of efficiency, the bitsize of an encoding grows sublinearly with κ, more precisely O((log2 κ) 2). To this end, we essentially utilize a technique of the multiplication procedure in scaleinvariant fully homomorphic encryption (FHE), which enables to achieve sublinear complexity in terms of multilinearity and at the same time security against the zeroizing attacks (EUROCRYPT 2015, IACREprint
Bounded Fully Homomorphic Signature Schemes
"... Abstract. Homomorphic signatures enable anyone to publicly perform computations on signed data and produce a compact tag to authenticate the results. In this paper, we construct two bounded fully homomorphic signature schemes, as follows. – For any two polynomials d = d(λ), s = s(λ), where λ is the ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Homomorphic signatures enable anyone to publicly perform computations on signed data and produce a compact tag to authenticate the results. In this paper, we construct two bounded fully homomorphic signature schemes, as follows. – For any two polynomials d = d(λ), s = s(λ), where λ is the security parameter. Our first scheme is able to evaluate any circuit on the signatures, as long as the depth and size of the circuit are bounded by d and s, respectively. The construction relies on indistinguishability obfuscation and injective (or polynomially bounded preimage size) oneway functions. – The second scheme, removing the restriction on the size of the circuits, is an extension of the first one, with succinct verification and evaluation keys. More specifically, for an aprior polynomial d = d(λ), the scheme allows to evaluate any circuit on the signatures, as long as the depth of the circuit is bounded by d. This scheme is based on differinginputs obfuscation and collisionresistant hash functions and relies on a technique called recording hash of circuits. Both schemes enjoy the composition property. Namely, outputs of previously derived signatures can be reused as inputs for new computations. The length of derived signatures in both schemes is independent of the size of the data set. Moreover, both constructions satisfy a strong privacy notion, we call semistrong context hiding, which requires that the derived signatures of evaluating any circuit on the signatures of two data sets are identical as long as the evaluations of the circuit on these two data sets are the same.