J. Kilian Uses of Randomness in Algorithms and Protocols, Chapter 3, The ACM Distinghished Dissertation 1989, MIT press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (24 citations) (Correct)
....called commit and prove. This functionality allows a a party to commit to values and then prove in zero knowledge arbitrary NP statements about the committed values. This notion was implicitly present in the work of Goldreich, Micali, and Wigderson [33] and explicitly proposed by Kilian [37]. We formalize it as an ideal functionality in the UC framework. We realize the commit and prove functionality given access to (multiple copies of) the ideal zero knowledge functionality. Finally, we cast the protocol compiler of [33] in a model where the parties have access to the ideal ....
J. Kilian Uses of Randomness in Algorithms and Protocols, Chapter 3, The ACM Distinghished Dissertation 1989, MIT press.
Using Probabilistic I/O Automata to Analyze an.. - Canetti, Cheung.. (2005) (Correct)
No context found.
J. Kilian Uses of Randomness in Algorithms and Protocols, Chapter 3, The ACM Distinghished Dissertation 1989, MIT press.
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