| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
|
Fuller, Benjamin
|
|
2013
|
28 |
3 |
p. 671-717
|
article
|
| 2 |
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
|
Fuller, Benjamin
|
|
|
28 |
3 |
p. 671-717
|
article
|
| 3 |
GNUC: A New Universal Composability Framework
|
Hofheinz, Dennis
|
|
2013
|
28 |
3 |
p. 423-508
|
article
|
| 4 |
GNUC: A New Universal Composability Framework
|
Hofheinz, Dennis
|
|
|
28 |
3 |
p. 423-508
|
article
|
| 5 |
How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge
|
Malka, Lior
|
|
2013
|
28 |
3 |
p. 533-550
|
article
|
| 6 |
How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge
|
Malka, Lior
|
|
|
28 |
3 |
p. 533-550
|
article
|
| 7 |
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
|
Dunkelman, Orr
|
|
2013
|
28 |
3 |
p. 397-422
|
article
|
| 8 |
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
|
Dunkelman, Orr
|
|
|
28 |
3 |
p. 397-422
|
article
|
| 9 |
On the Complexity of Constructing Pseudorandom Functions (Especially when They Don’t Exist)
|
Miles, Eric
|
|
2013
|
28 |
3 |
p. 509-532
|
article
|
| 10 |
On the Complexity of Constructing Pseudorandom Functions (Especially when They Don’t Exist)
|
Miles, Eric
|
|
|
28 |
3 |
p. 509-532
|
article
|
| 11 |
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography
|
Tsaban, Boaz
|
|
2013
|
28 |
3 |
p. 601-622
|
article
|
| 12 |
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography
|
Tsaban, Boaz
|
|
|
28 |
3 |
p. 601-622
|
article
|
| 13 |
Protocols for Multiparty Coin Toss with a Dishonest Majority
|
Beimel, Amos
|
|
2013
|
28 |
3 |
p. 551-600
|
article
|
| 14 |
Protocols for Multiparty Coin Toss with a Dishonest Majority
|
Beimel, Amos
|
|
|
28 |
3 |
p. 551-600
|
article
|
| 15 |
Provable Unlinkability Against Traffic Analysis with Low Message Overhead
|
Berman, Ron
|
|
2013
|
28 |
3 |
p. 623-640
|
article
|
| 16 |
Provable Unlinkability Against Traffic Analysis with Low Message Overhead
|
Berman, Ron
|
|
|
28 |
3 |
p. 623-640
|
article
|
| 17 |
Reflection Cryptanalysis of PRINCE-Like Ciphers
|
Soleimany, Hadi
|
|
2013
|
28 |
3 |
p. 718-744
|
article
|
| 18 |
Reflection Cryptanalysis of PRINCE-Like Ciphers
|
Soleimany, Hadi
|
|
|
28 |
3 |
p. 718-744
|
article
|
| 19 |
Tight Security for Signature Schemes Without Random Oracles
|
Schäge, Sven
|
|
2013
|
28 |
3 |
p. 641-670
|
article
|
| 20 |
Tight Security for Signature Schemes Without Random Oracles
|
Schäge, Sven
|
|
|
28 |
3 |
p. 641-670
|
article
|
Journal description