| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Confined Guessing: New Signatures From Standard Assumptions
|
Böhl, Florian
|
|
2014
|
28 |
1 |
p. 176-208
|
article
|
| 2 |
Confined Guessing: New Signatures From Standard Assumptions
|
Böhl, Florian
|
|
|
28 |
1 |
p. 176-208
|
article
|
| 3 |
Cryptanalysis of SHA-0 and Reduced SHA-1
|
Biham, Eli
|
|
2014
|
28 |
1 |
p. 110-160
|
article
|
| 4 |
Cryptanalysis of SHA-0 and Reduced SHA-1
|
Biham, Eli
|
|
|
28 |
1 |
p. 110-160
|
article
|
| 5 |
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation
|
Patra, Arpita
|
|
2013
|
28 |
1 |
p. 49-109
|
article
|
| 6 |
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation
|
Patra, Arpita
|
|
|
28 |
1 |
p. 49-109
|
article
|
| 7 |
Quantum Private Information Retrieval has Linear Communication Complexity
|
Baumeler, Ämin
|
|
2014
|
28 |
1 |
p. 161-175
|
article
|
| 8 |
Quantum Private Information Retrieval has Linear Communication Complexity
|
Baumeler, Ämin
|
|
|
28 |
1 |
p. 161-175
|
article
|
| 9 |
Slidex Attacks on the Even–Mansour Encryption Scheme
|
Dunkelman, Orr
|
|
2013
|
28 |
1 |
p. 1-28
|
article
|
| 10 |
Slidex Attacks on the Even–Mansour Encryption Scheme
|
Dunkelman, Orr
|
|
|
28 |
1 |
p. 1-28
|
article
|
| 11 |
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed?
|
Bellare, Mihir
|
|
2013
|
28 |
1 |
p. 29-48
|
article
|
| 12 |
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed?
|
Bellare, Mihir
|
|
|
28 |
1 |
p. 29-48
|
article
|
Journal description