`Travelled to:`

1 × Canada

1 × Italy

3 × USA

`Collaborated with:`

∅ P.Voulgaris V.Lyubashevsky S.Panjwani S.Mantaci R.Canetti O.Reingold

`Talks about:`

case (3) algorithm (2) function (2) corrupt (2) hash (2) one (2) cryptographi (1) probabilist (1) determinist (1) cryptograph (1)

## Person: Daniele Micciancio

### DBLP: Micciancio:Daniele

### Contributed to:

### Wrote 7 papers:

- STOC-2010-MicciancioV #algorithm #exponential #problem
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (DM, PV), pp. 351–358.
- ICALP-v2-2006-LyubashevskyM
- Generalized Compact Knapsacks Are Collision Resistant (VL, DM), pp. 144–155.
- ICALP-v2-2006-MicciancioP #encryption #multi
- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption (DM, SP), pp. 70–82.
- STOC-2002-Micciancio #encryption #worst-case
- Improved cryptographic hash functions with worst-case/average-case connection (DM), pp. 609–618.
- STOC-1998-CanettiMR #probability
- Perfectly One-Way Probabilistic Hash Functions (RC, DM, OR), pp. 131–140.
- STOC-1997-Micciancio #data type #encryption
- Oblivious Data Structures: Applications to Cryptography (DM), pp. 456–464.
- TAPSOFT-1997-MantaciM #algorithm #equation
- An Algorithm for the Solution of Tree Equations (SM, DM), pp. 417–428.