| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Asymptotically Efficient Lattice-Based Digital Signatures
|
Lyubashevsky, Vadim
|
|
2017
|
31 |
3 |
p. 774-797
|
artikel
|
| 2 |
Asymptotically Efficient Lattice-Based Digital Signatures
|
Lyubashevsky, Vadim
|
|
|
31 |
3 |
p. 774-797
|
artikel
|
| 3 |
Completeness for Symmetric Two-Party Functionalities: Revisited
|
Lindell, Yehuda
|
|
2017
|
31 |
3 |
p. 671-697
|
artikel
|
| 4 |
Completeness for Symmetric Two-Party Functionalities: Revisited
|
Lindell, Yehuda
|
|
|
31 |
3 |
p. 671-697
|
artikel
|
| 5 |
Efficient Slide Attacks
|
Bar-On, Achiya
|
|
2017
|
31 |
3 |
p. 641-670
|
artikel
|
| 6 |
Efficient Slide Attacks
|
Bar-On, Achiya
|
|
|
31 |
3 |
p. 641-670
|
artikel
|
| 7 |
Fast Garbling of Circuits Under Standard Assumptions
|
Gueron, Shay
|
|
2017
|
31 |
3 |
p. 798-844
|
artikel
|
| 8 |
Fast Garbling of Circuits Under Standard Assumptions
|
Gueron, Shay
|
|
|
31 |
3 |
p. 798-844
|
artikel
|
| 9 |
Key-Recovery Attacks on ASASA
|
Minaud, Brice
|
|
2017
|
31 |
3 |
p. 845-884
|
artikel
|
| 10 |
Key-Recovery Attacks on ASASA
|
Minaud, Brice
|
|
|
31 |
3 |
p. 845-884
|
artikel
|
| 11 |
On Constructing One-Way Permutations from Indistinguishability Obfuscation
|
Asharov, Gilad
|
|
2017
|
31 |
3 |
p. 698-736
|
artikel
|
| 12 |
On Constructing One-Way Permutations from Indistinguishability Obfuscation
|
Asharov, Gilad
|
|
|
31 |
3 |
p. 698-736
|
artikel
|
| 13 |
On the Feasibility of Extending Oblivious Transfer
|
Lindell, Yehuda
|
|
2017
|
31 |
3 |
p. 737-773
|
artikel
|
| 14 |
On the Feasibility of Extending Oblivious Transfer
|
Lindell, Yehuda
|
|
|
31 |
3 |
p. 737-773
|
artikel
|
| 15 |
Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
|
Canteaut, Anne
|
|
2018
|
31 |
3 |
p. 885-916
|
artikel
|
| 16 |
Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
|
Canteaut, Anne
|
|
|
31 |
3 |
p. 885-916
|
artikel
|
Tijdschrift beschrijving