Your search for 38198 returns 2800 document(s) |
Effecient zero-knowledge proofs for some practical graph problems, (LNCS-Lecture Notes in Computer Science 2576) Hal 290-302 |
Author: Yvo Desmedt; Yongge Wang; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Reduction Zero-Knowledge, (LNCS-Lecture Notes in Computer Science 2576) Hal 303-317 |
Author: Xiaotie Deng; C.H.Lee; Yunlei Zhao; Hong Zhu; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Some application of polynomials for the design of cryptographic protocols, (LNCS-Lecture Notes in Computer Science 2576) Hal 1-13 |
Author: Eyal Kushilevitz; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Effecient probabilistically checkable proofs and applications to approximation,Hal 820 |
Author: M.Bellare; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Bounds of graph characteristics, (LNCS-Lecture Notes in Computer Science 3709) Hal 742-746 |
Author: Nicolas Beldiceanu; Thierry Petit; Guillaume Rochart; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Using the rippling heuristic in set membership proofs, (LNCS-Lecture Notes in Computer Science 1212)Hal. 135-147 |
Author: Ina Kraan; | Call Number: 005.133 Bow z | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
On the correctness of scurity proofs for the 3GPP confidentiality and integrity algorithms, LNCS-Lecture Notes in Computer Science 2898), Hal. 206-318 |
Author: Testsu Iwata and Kaoru Kurosawa; | Call Number: 005.82 Cry | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Some thoughts on statecharts, 13 years later, (LNCS-Lecture Notes in Computer Science 1254) Hal 226-231 |
Author: David Harel; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Some progress in the symbolic verification of timed automata, (LNCS-Lecture Notes in Computer Science 1254) Hal 179-190 |
Author: Marius Bozga; Oded Maler; Amir Pnueli; Sergio Yovine; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Formal verification for fault-tolerant architectures: some lessons learned, (LNCS-Lecture Notes in Computer Science 670) Hal 482-500 |
Author: Sam Owre; John Rushby; Natarajan Shankar; Friedrich von Henke; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|