We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets in widely-distributed storage system.We present two provably-secure PDP schemes that are more efficient than previous solutions, even when compared with schemes that achieve weaker guarantees. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data. Experiments using our implementation verify the practicality of PDP and reveal that the performance of PDP is bounded by disk I/O and not by cryptographic computation.

/pdf/provable-data-possession-at-untrusted-stores-2jbt1jxu32.pdf

Provable data possession at untrusted stores

We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets in widely-distributed storage systems. We present two provably-secure PDP schemes that are more efficient than previous solutions, even when compared with schemes that achieve weaker guarantees. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data. Experiments using our implementation verify the practicality of PDP and reveal that the performance of PDP is bounded by disk I/O and not by cryptographic computation.

/pdf/provable-data-possession-at-untrusted-stores-5ax3ivpitq.pdf

Provable Data Possession at Untrusted Stores.

The fabrication methods of the microelectronics industry have been refined to produce ever smaller devices, but will soon reach their fundamental limits. A promising alternative route to even smaller functional systems with nanometre dimensions is the autonomous ordering and assembly of atoms and molecules on atomically well-defined surfaces. This approach combines ease of fabrication with exquisite control over the shape, composition and mesoscale organization of the surface structures formed. Once the mechanisms controlling the self-ordering phenomena are fully understood, the self-assembly and growth processes can be steered to create a wide range of surface nanostructures from metallic, semiconducting and molecular materials.

/pdf/engineering-atomic-and-molecular-nanostructures-at-surfaces-2sqr7sjd15.pdf

Engineering atomic and molecular nanostructures at surfaces

http://files.janapv.webnode.cz/200000097-8a03f8afdf/ex_bias_nano.pdf

Exchange bias in nanostructures

Multiferroic magnetoelectric composite systems such as ferromagnetic-ferroelectric heterostructures have recently attracted an ever-increasing interest and provoked a great number of research activities, driven by profound physics from coupling between ferroelectric and magnetic orders, as well as potential applications in novel multifunctional devices, such as sensors, transducers, memories, and spintronics. In this Review, we try to summarize what remarkable progress in multiferroic magnetoelectric composite systems has been achieved in most recent few years, with emphasis on thin films; and to describe unsolved issues and new device applications which can be controlled both electrically and magnetically.

Recent Progress in Multiferroic Magnetoelectric Composites: from Bulk to Thin Films

In this paper, we review the evolutionary path of magnetic data storage and examine the physical phenomena that will prevent us from continuing the use of those scaling processes which have served us in the past. It is concluded that the first problem will arise from the storage medium, whose grain size cannot be scaled much below a diameter of ten nanometers without thermal self-erasure. Other problems will involve head-to-disk spacings that approach atomic dimensions, and switching-speed limitations in the head and medium. It is likely that the rate of progress in areal density will decrease substantially as we develop drives with ten to a hundred times current areal densities. Beyond that, the future of magnetic storage technology is unclear. However, there are no alternative technologies which show promise for replacing hard disk storage in the next ten years.

J. S. Best

Papers

The future of magnetic data storage technology

The Future of Magnetic Data Storage Technology