R. Rivest, "Cryptography," in Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity (J. van Leeuwen, ed.), ch. 13, pp. 717--755, Cambridge, Massachusetts: The MIT Press, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....tested. This detection characteristic exists due to the combined static and dynamic representation of the watermark. 3) An Author Representation Which Solves the Deadlock Problem: The author or owner of the video is represented with a pseudorandom sequence created by a pseudorandom generator [13] and two keys. One key is author dependent, while the second key is signal dependent. The representation is able to resolve rightful ownership in the face of multiple ownership claims. 4) A Dual Watermark: The watermarking scheme introduced in this paper uses the original video signal to detect ....

....independently by [15] Both techniques solve the shortcomings of the solution proposed in [14] for solving the deadlock problem. Specifically, the author has two random keys and (i.e. seeds) from which a pseudorandom sequence can be generated using a suitable pseudorandom sequence generator [13]. Popular generators include RSA, Rabin, Blum Micali, and Blum Blum Shub [16] With the two proper keys, the watermark may be extracted. Without the two keys, the data hidden in the video is statistically undetectable and impossible to recover. Note that we do not use the classical maximal length ....

[Article contains additional citation context not shown here]

R. Rivest, "Cryptography," in Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., vol. 1. Cambridge, MA: MIT Press, 1990, pp. 717--755.

....ffi y U and m ffi (x U ffi y U ) The recipient accepts oe as a valid signature of m by U if and only if oe ffi y U = m ffi (x U ffi y U ) As with many other signature schemes, this M. Rabi and A. Sherman, Associative One Way Functions November 15, 1993 9 scheme is vulnerable to what Rivest [15] calls existential forgery: given any valid messagesignature pair (m; oe U (m) it is possible to forge signatures of new messages of the form m 0 = z ffi m, for any z 2 M. Specifically, forge oe U (m 0 ) m 0 ffi xU = z ffi m) ffi xU by computing oe U (m 0 ) z ffi oe U (m) z ffi ....

Rivest, Ronald L., "Cryptography" in Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity, J. van Leeuwen, ed., Chapter 13, MIT Press/Elsevier (1990), 717--755.

....monitors into Java s security policy, and Netscape has announced that version 4.0 of their browser will use the technique. In the language used in the security literature, the principal is the entity making the request, and the target is the system resource that the principal desires to access [32]. When an applet accesses a system resource, a reference monitor receives a request from a principal for a target. To determine COM.javasoft file read path COM.javasoft net connect remoteIP:port COM.javasoft awt maketoplevelwindow number Figure 2.2: Example Configuration File. whether the ....

....(PKE) scheme allows a server to digitally encrypt information using a private key. The client can then decrypt the information using the corresponding public key [14] As long as the private key is not made public, it is computationally hard for a malicious entity to guess the private key [32]. Public key encryption is the underlying technology behind many security solutions used for networks, including secure communications (SSL) electronic transactions (SET) and email encoding (S MIME) PKE can also be used to construct digital signatures. A digital signature is a unique, ....

R. Rivest. "Cryptography." Handbook of Theoretical Computer Science. Chapter 13. Elsevier Science Publishers. 1990.

....problem, such as factoring large numbers or computing discrete logarithms in the case of many public key systems. Security proofs for these systems show that the ability of the adversary to defeat the cryptosystem with significant probability contradicts the assumed difficulty of the problem [24]. Although the hardness of these problems is unquestioned at the moment, it can be dangerous to base the security of the global information economy on a very small number of mathematical problems. Recent advances in quantum computing show that precisely these two problems, factoring and discrete ....

R. L. Rivest, "Cryptography," in Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), ch. 13, pp. 717--755, Elsevier, 1990.

....E and D satisfy the following unique decipherability condition, namely D(sk; E(pk; m) m. 2. 1 Attacks to Cryptosystems There are four common types of attack to a cryptosystem, namely ciphertext only attacks, known plaintext attacks, chosen plaintext attacks and chosen ciphertext attacks [10]. Related attacks against digital signatures are fully discussed in [11] In a ciphertext only attack, which is the least severe among the four types of attack, an attacker is given an object ciphertext and tries to find the plaintext which is hidden in the object ciphertext. In a known plaintext ....

R. Rivest, "Cryptography," in Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity (J. van Leeuwen, ed.), ch. 13, pp. 717--755, Cambridge, Massachusetts: The MIT Press, 1990.

....some sense, it should not have. It is now common knowledge among computer scientists that NP completeness is largely irrelevant to public key cryptography, since in that area one needs sophisticated cryptographic assumptions that go beyond NP completeness and worst case polynomial time computation [19]; furthermore, cryptographic protocols based on NP complete problems have been ill fated. Fortunately, the founders of modern cryptography did not know this. Diffie and Hellman base their famous pronouncement We stand today on the brink of a revolution in cryptography [3] on two facts: 1) Very ....

R. L. Rivest "Cryptography," pp. 717--755 in Handbook of Theoretical Computer Science, J. van Leeuwen (ed), The MIT Press/Elsevier, 1990.

No context found.

R. Rivest, "Cryptography," in Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity (J. van Leeuwen, ed.), ch. 13, pp. 717--755, Cambridge, Massachusetts: The MIT Press, 1990.

No context found.

, 594--601. 26. R.L. Rivest. "Cryptography", Chapter 13 of Handbook of Theoretical Computer Science,

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