( en | de | ru )

 

Disambiguation of "Rackoff, Charles"

Author of the publication

copydeleteadd this publication to your clipboard
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

, and . Advances in Cryptology --- CRYPTO '91, page 433--444. Berlin, Heidelberg, Springer Berlin Heidelberg, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Charles Asseke

Charles Bannerman

Charles Trenckle

Charles Horowitz

Charles Hall

 

Other publications of authors with the same name

A Study of Password Security., and . CRYPTO, volume 293 of Lecture Notes in Computer Science, page 392-397. Springer, (1987)Secret Bit Transmission Using a Random Deal of Cards., , and . Distributed Computing And Cryptography, volume 2 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 173-182. DIMACS/AMS, (1989)The Emptiness Problem for Automata on Infinite Trees, and . SWAT, page 121-124. IEEE Computer Society, (1972)Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack., and . CRYPTO, volume 576 of Lecture Notes in Computer Science, page 433-444. Springer, (1991)The Notion of Security for Probabilistic Cryptosystems., , and . CRYPTO, volume 263 of Lecture Notes in Computer Science, page 381-392. Springer, (1986)(Incremental) Priority Algorithms., , and . Algorithmica, 37 (4): 295-326 (2003)(Incremental) priority algorithms., , and . SODA, page 752-761. ACM/SIAM, (2002)The Knowledge Complexity of Interactive Proof Systems, , and . SIAM J. Comput., 18 (1): 186-208 (1989)Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems, , , , and . FOCS, page 218-223. IEEE Computer Society, (1979)Lower Bounds For Concurrent Zero Knowledge*., , and . Combinatorica, 25 (2): 217-249 (2005)