504 search results - page 11 / 101 » Complexity Properties of Restricted Abstract Argument System... |
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
ATAL
2003
Springer
14 years 26 days ago
2003
Springer
Communication is the key feature of Multi-agent Systems. The interactions among components of a system may take many distinct forms of increasing complexity such as in auctions, n...
IANDC
2008
13 years 7 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
JOC
2000
13 years 7 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...