We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...