Your search for 38225 returns 3976 document(s) |
Using OCSP to secure certificate-using transactions in m-commerce, (LNCS-Lecture Notes in Computer Science 2576) Hal 280-292 |
Author: Jose L. Munoz; Jordi Forne; Oscar Esparza; Bernabe Miguel Soriano; | Call Number: 005.8 Zho a | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Flexible internet secure transactions based on collaborative domains, (LNCS-Lecture Notes in Computer Science 1361) Hal 37-51 |
Author: Eduardo Solana; Jurgen Harms; | Call Number: 004.62 Chr s | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Secure multi-party computation made simple, (LNCS-Lecture Notes in Computer Science 2576) Hal 14-28 |
Author: Ueli Maurer; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
On a class of key agreement protocols which cannot be unconditionally secure, (LNCS-Lecture Notes in Computer Science 2576) Hal 133-145 |
Author: Frank Niedermeyer; Werner Schindler; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Forward-secure signatures with fast key update, (LNCS-Lecture Notes in Computer Science 2576) Hal 241-256 |
Author: Anton Kozlov; Leonid Reyzin; | Call Number: 005.8 Sec | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Secure multi-party computation using virtual parties for computation on encrypted data, (LNCS-Lecture Notes in Computer Science 5576) Hal. 412-421 |
Author: Rohit Pathak; Satyadhar Joshi; | Call Number: 005.8 Adv | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
An efficient tree-based group key agreement using bilinear map, (LNCS-Lecture Notes in Computer Science 2576) Hal 357-371 |
Author: Sangwon Lee; Yongdae Kim; Kwangjo Kim; Dae-Hyun Ryu; | Call Number: 005.8 Zho a | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Multy-party Computation from any linear secret sharing scheme unconditionally secure againts adaptive adversary: the zero-error case, (LNCS-Lecture Notes in Computer Science 2576) Hal 1-15 |
Author: Ventzislav Nikov; Svetla Nikova; Bart Preneel; | Call Number: 005.8 Zho a | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Using sat in qbf, (LNCS-Lecture Notes in Computer Science 3709) Hal 578-592 |
Author: Horst Samulowitz; Fahiem Bacchus; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A New strongly secure authenticated key exchange protocol, (LNCS-Lecture Notes in Computer Science 5576) Hal. 135-144 |
Author: Qingfeng Cheng; Chuangui Ma, and Xuexian Hu; | Call Number: 005.8 Adv | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|