We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe...
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
While a lot of work has been done on the problem of the automated generation of plans that compose web services, the problem of monitoring their execution has still to be investig...
Fabio Barbon, Paolo Traverso, Marco Pistore, Miche...
Orthogonal Frequency-Division Multiplexing (OFDM) has become the preferred modulation scheme for both broadband and high bitrate digital wireless protocols because of its spectral...
Man Cheuk Ng, Muralidaran Vijayaraghavan, Nirav Da...