| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
General Composition and Universal Composability in Secure Multiparty Computation
|
Lindell, Yehuda
|
|
2008
|
22 |
3 |
p. 395-428
|
artikel
|
| 2 |
General Composition and Universal Composability in Secure Multiparty Computation
|
Lindell, Yehuda
|
|
|
22 |
3 |
p. 395-428
|
artikel
|
| 3 |
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
|
Black, J.
|
|
2008
|
22 |
3 |
p. 311-329
|
artikel
|
| 4 |
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
|
Black, J.
|
|
|
22 |
3 |
p. 311-329
|
artikel
|
| 5 |
Reducing Complexity Assumptions for Statistically-Hiding Commitment
|
Haitner, Iftach
|
|
2007
|
22 |
3 |
p. 283-310
|
artikel
|
| 6 |
Reducing Complexity Assumptions for Statistically-Hiding Commitment
|
Haitner, Iftach
|
|
|
22 |
3 |
p. 283-310
|
artikel
|
| 7 |
Upper and Lower Bounds on Black-Box Steganography
|
Dedić, Nenad
|
|
2008
|
22 |
3 |
p. 365-394
|
artikel
|
| 8 |
Upper and Lower Bounds on Black-Box Steganography
|
Dedić, Nenad
|
|
|
22 |
3 |
p. 365-394
|
artikel
|
| 9 |
Using Abelian Varieties to Improve Pairing-Based Cryptography
|
Rubin, K.
|
|
2008
|
22 |
3 |
p. 330-364
|
artikel
|
| 10 |
Using Abelian Varieties to Improve Pairing-Based Cryptography
|
Rubin, K.
|
|
|
22 |
3 |
p. 330-364
|
artikel
|
Tijdschrift beschrijving