In this paper we consider the problem of securely instantiating Probabilistic Signature Scheme (PSS) in the standard model. PSS, proposed by Bellare and Rogaway [3] is a widely deployed randomized signature scheme, provably secure (unforgeable under adaptively chosen message attacks) in Random Oracle Model. Our main result is a black-box impossibility result showing that one can not prove unfor...

Lossy channel systems model a set of nite state processes interacting with each other over unbounded, lossy FIFO channels. This computational model is an abstraction of protocols in the lower layers of the network protocol hierarchy. In spite of its unbounded FIFO queues the Lossy channel system model is not turing-powerful. It has been shown that the reachability problem is decidable 1]. Howev...

We study the effectiveness of various approaches that defend against adversarial attacks on deep networks via manipulations based on basis function representations of images. Specifically, we experiment with low-pass filtering, PCA, JPEG compression, low resolution wavelet approximation, and soft-thresholding. We evaluate these defense techniques using three types of popular attacks in black, g...

In this review paper, we present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP). This treatment closely parallels the corresponding development in lossless compression, a point of view that was advanced in an important paper of Wyner and Ziv in 1989. In th...

We propose a practical technique for the identification of lossy network links from end-to-end measurements. Our scheme is based on a function that computes the likelihood of each link to be lossy. This function depends on the number of times a link appears in lossy paths and on the relative loss rates of these paths. Preliminary simulation results show that our algorithm achieves accuracy high...

Shannon’s rate-distortion curve characterizes optimal lossy compression. I show here that the optimization principle that has to be solved to compute the rate-distortion function can be derived from a least effort principle: minimizing required thermodynamic effort necessitates the minimization of information (compatible with a given fidelity). Retaining less information costs less physical eff...

For a variety of infinite-state systems, the problem of deciding whether a given system is self-stabilizing or not is investigated from the decidability viewpoint. We develop a unified strategy through which checking self-stabilization is shown to be decidable for lossy vector addition systems with states, one-counter machines, and conflict-free Petri nets. For lossy counter machines and lossy ...

The optically transparent antenna technology has been gaining attention in consumer electronic industry owing to its potential release the volume constraints compact mobile devices. Earlier studies have heavily focused on integration display for smartphone applications, example, improve spatial coverage of 5G mm-wave at forehead side. To our knowledge, application smart glasses and augmented re...

Intratube quantum dots showing particle-in-a-box-like states with level spacings up to 200 meV are realized in metallic single-walled carbon nanotubes by means of low dose medium energy Ar(+) irradiation. Fourier-transform scanning tunneling spectroscopy compared to results of a Fabry-Perot electron resonator model yields clear signatures for inter- and intravalley scattering of electrons confi...

Compression refers to encoding data using bits, so that the representation uses as few bits as possible. Compression could be lossless: i.e. encoded data can be recovered exactly from its representation) or lossy where the data is compressed more than the lossless case, but can still be recovered to within prespecified distortion metric. In this paper, we prove the optimality of Codelet Parsing...