A. Beimel, M. Burmester, Y. Desmedt, and E. Kushilevitz, "Computing Functions of a Shared Secret," SIAM J. Discrete Math., vol. 13, no. 3, pp. 324-345, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Watermarking, Tamper-Proofing, and Obfuscation - Tools for.. - Collberg, al. (2002) (7 citations) (Correct)
....[22] 28] 35] 60] tamper proofing [5] 6] 38] 77] and obfuscation [20] 23] 24] 25] 38] 49] 65] 92] have emerged as feasible technical means for the intellectual property protection of software. Other promising techniques, such as traitor tracing [14] secret sharing [8], reference states [39] and secure evaluation [2] 77] are still in the hands of theorists. Obfuscation attempts to transform a program into an equivalent one that is harder to reverse engineer. Tamper proofing causes a program to malfunction when it detects that it has been modified. Software ....
A. Beimel, M. Burmester, Y. Desmedt, and E. Kushilevitz, "Computing Functions of a Shared Secret," SIAM J. Discrete Math., vol. 13, no. 3, pp. 324-345, 2000.
Watermarking, Tamper-Proofing, and Obfuscation - Tools for .. - Collberg, Thomborson (2000) (7 citations) (Correct)
....be achieved. Recently, software watermarking [22,28,35,60] tamper proofing [5,6,38,77] and obfuscation [20,23 25,38,49,65, 92] have emerged as feasible technical means for the intellectual property protection of software. Other promising techniques, such as traitor tracing [14] secret sharing [8], reference states [39] and secure evaluation [2,77] are still in the hands of theorists. Obfuscation attempts to transform a program into an equivalent one that is harder to reverse engineer. Tamper proofing causes a program to malfunction when it detects that it has been modified. Software ....
Amos Beimel, Mike Burmester, Yvo Desmedt, and Eyal Kushilevitz. Computing functions of a shared secret. SIAM J. on Discrete Mathematics, 13(3):324--345, 2000.
Some Recent Research Aspects of Threshold Cryptography - Desmedt (1997) (18 citations) Self-citation (Desmedt) (Correct)
....are required, which implies that if l is even and t corresponds to majority, i.e. bl=2c 1) no practical threshold DSS signature scheme has been presented so far. Abstraction One can wonder whether there is a need that g is a homomorphism. More general approaches have been discussed in [3]. We briefly focus on one of those (see also [11] Suppose that shareholders of a key want to compute g input (key) in a practical distributed way. This is, for example, possible if there exist a recomputation function j 0 and functions g 0 such that g input (key) j 0 Gamma g 0 input ....
A. Beimel, M. Burmester, Y. Desmedt, and E. Kushilevitz. Computing functions of a shared secret. Manuscript, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC