| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption
|
Choi, Seung Geol
|
|
2017
|
31 |
1 |
p. 172-201
|
artikel
|
| 2 |
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption
|
Choi, Seung Geol
|
|
|
31 |
1 |
p. 172-201
|
artikel
|
| 3 |
All-But-Many Encryption
|
Fujisaki, Eiichiro
|
|
2017
|
31 |
1 |
p. 226-275
|
artikel
|
| 4 |
All-But-Many Encryption
|
Fujisaki, Eiichiro
|
|
|
31 |
1 |
p. 226-275
|
artikel
|
| 5 |
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
|
Komargodski, Ilan
|
|
2017
|
31 |
1 |
p. 60-100
|
artikel
|
| 6 |
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
|
Komargodski, Ilan
|
|
|
31 |
1 |
p. 60-100
|
artikel
|
| 7 |
Function-Private Functional Encryption in the Private-Key Setting
|
Brakerski, Zvika
|
|
2017
|
31 |
1 |
p. 202-225
|
artikel
|
| 8 |
Function-Private Functional Encryption in the Private-Key Setting
|
Brakerski, Zvika
|
|
|
31 |
1 |
p. 202-225
|
artikel
|
| 9 |
How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
|
Gilboa, Shoni
|
|
2017
|
31 |
1 |
p. 162-171
|
artikel
|
| 10 |
How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
|
Gilboa, Shoni
|
|
|
31 |
1 |
p. 162-171
|
artikel
|
| 11 |
Incremental Deterministic Public-Key Encryption
|
Mironov, Ilya
|
|
2017
|
31 |
1 |
p. 134-161
|
artikel
|
| 12 |
Incremental Deterministic Public-Key Encryption
|
Mironov, Ilya
|
|
|
31 |
1 |
p. 134-161
|
artikel
|
| 13 |
Making the Impossible Possible
|
Boura, Christina
|
|
2017
|
31 |
1 |
p. 101-133
|
artikel
|
| 14 |
Making the Impossible Possible
|
Boura, Christina
|
|
|
31 |
1 |
p. 101-133
|
artikel
|
| 15 |
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings
|
Applebaum, Benny
|
|
2016
|
31 |
1 |
p. 1-22
|
artikel
|
| 16 |
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings
|
Applebaum, Benny
|
|
|
31 |
1 |
p. 1-22
|
artikel
|
| 17 |
Optimal Security Proofs for Full Domain Hash, Revisited
|
Kakvi, Saqib A.
|
|
2017
|
31 |
1 |
p. 276-306
|
artikel
|
| 18 |
Optimal Security Proofs for Full Domain Hash, Revisited
|
Kakvi, Saqib A.
|
|
|
31 |
1 |
p. 276-306
|
artikel
|
| 19 |
Practical Homomorphic Message Authenticators for Arithmetic Circuits
|
Catalano, Dario
|
|
2017
|
31 |
1 |
p. 23-59
|
artikel
|
| 20 |
Practical Homomorphic Message Authenticators for Arithmetic Circuits
|
Catalano, Dario
|
|
|
31 |
1 |
p. 23-59
|
artikel
|
Tijdschrift beschrijving