#### Filter Results:

- Full text PDF available (99)

#### Publication Year

1987

2017

- This year (4)
- Last 5 years (34)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano
- EUROCRYPT
- 2003

We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An email gateway wants to test whether the email contains the keyword “urgent” so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the… (More)

Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attention in the last decade and has been used throughout modern cryptography in several essential ways. For example, NIZK plays a central role in building provably secure public-key cryptosystems… (More)

- Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano
- SIAM J. Comput.
- 1991

This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zero-knowledge proofs exist for some number-theoretic languages for which no efficient algorithm is known. If deciding quadratic… (More)

- Vincenzo Iovino, Giuseppe Persiano
- Pairing
- 2008

We consider the problem of scheduling jobs on parallel related machines owned by selfish agents. We provide deterministic polynomial-time (2 + ǫ)-approximation algorithms and suitable payment functions that yield truthful mechanisms for several NP-hard restrictions of this problem. Up to our knowledge, our result is the first non-trivial polynomial-time… (More)

- Vincenzo Auletta, Angelo Monti, Mimmo Parente, Giuseppe Persiano
- Algorithmica
- 1996

We consider the following pebble motion problem. We are given a tree T with n vertices and two arrangements $\cal R$ and $\cal S$ of k<n distinct pebbles numbered 1, . . ., k on distinct vertices of the tree. Pebbles can move along edges of T provided that at any given time at most one pebble is traveling along an edge and each vertex of T contains at most… (More)

- Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
- J. Comput. Syst. Sci.
- 2004

We study combinatorial optimization problems involving one-parameter selfish agents considered by Archer and Tardos [FOCS 2001]. In particular, we show that, if agents can lie in one direction (that is they either overbid or underbid) then any (polynomial-time) capproximation algorithm, for the optimization problem without selfish agents, can be turned into… (More)

- Giuseppe Cattaneo, Luigi Catuogno, Aniello Del Sorbo, Giuseppe Persiano
- USENIX Annual Technical Conference, FREENIX Track
- 2001

- Alfredo De Santis, Silvio Micali, Giuseppe Persiano
- CRYPTO
- 1987

- Alfredo De Santis, Giuseppe Persiano
- FOCS
- 1992