Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
e type system for the lmdElulus enrihed with reurE sive nd oreursive funtions over equiEindutive nd Eoindutive types is presented in whih ll wel...
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Today’s model of networking primarily concentrates intelligence at the end hosts with the network itself offering a simple“best-effort”,“data agnostic” communication med...