Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Harel, David
and
Feldman, Yishai
1987.
Algorithmics.
p.
359.
Bellare, Mihir
Boldyreva, Alexandra
Desai, Anand
and
Pointcheval, David
2001.
Advances in Cryptology — ASIACRYPT 2001.
Vol. 2248,
Issue. ,
p.
566.
Barak, B.
2001.
How to go beyond the black-box simulation barrier.
p.
106.
Lindell, Yehuda
2001.
Advances in Cryptology — CRYPTO 2001.
Vol. 2139,
Issue. ,
p.
171.
Canetti, R.
2001.
Universally composable security: a new paradigm for cryptographic protocols.
p.
136.
Nielsen, Jesper Buus
2002.
Advances in Cryptology — CRYPTO 2002.
Vol. 2442,
Issue. ,
p.
401.
Kursawe, K.
2002.
Asynchronous Byzantine group communication.
p.
352.
Koshiba, Takeshi
2002.
Public Key Cryptography.
Vol. 2274,
Issue. ,
p.
34.
Backes, Michael
and
Pfitzmann, Birgit
2002.
Computer Security — ESORICS 2002.
Vol. 2502,
Issue. ,
p.
1.
Müller, Olaf
and
Nüsken, Michael
2002.
Progress in Cryptology — INDOCRYPT 2002.
Vol. 2551,
Issue. ,
p.
79.
Lipton, R.J.
Rajagopalan, S.
and
Serpanos, D.N.
2002.
Spy: a method to secure clients for network services.
p.
23.
Prabhakaran, M.
Rosen, A.
and
Sahai, A.
2002.
Concurrent zero knowledge with logarithmic round-complexity.
p.
366.
Canetti, Ran
and
Krawczyk, Hugo
2002.
Advances in Cryptology — EUROCRYPT 2002.
Vol. 2332,
Issue. ,
p.
337.
Canetti, Ran
and
Krawczyk, Hugo
2002.
Advances in Cryptology — CRYPTO 2002.
Vol. 2442,
Issue. ,
p.
143.
Wang, Yan
Lü, Shuwang
and
Liu, Zhenhua
2002.
Advanced Communications and Multimedia Security.
Vol. 100,
Issue. ,
p.
29.
Canetti, Ran
Kilian, Joe
Petrank, Erez
and
Rosen, Alon
2002.
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.
SIAM Journal on Computing,
Vol. 32,
Issue. 1,
p.
1.
Dyer, Martin
Goldberg, Leslie A.
and
Jerrum, Mark
2002.
Randomization and Approximation Techniques in Computer Science.
Vol. 2483,
Issue. ,
p.
51.
Naor, Moni
Reingold, Omer
and
Rosen, Alon
2002.
Pseudorandom Functions and Factoring.
SIAM Journal on Computing,
Vol. 31,
Issue. 5,
p.
1383.
Barak, B.
2002.
Constant-round coin-tossing with a man in the middle or realizing the shared random string model.
p.
345.
Dedić, Nenad
Reyzin, Leonid
and
Vadhan, Salil
2003.
Security in Communication Networks.
Vol. 2576,
Issue. ,
p.
88.