Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove that if this protocol is zero knowledge with a black-box, quantum simulator S, then L ∈ BQP. Our result also applies to any language having a three-round quantum interactive proof (QIP), with all but possibly the las...

P2P network is factually an overlay network for distributed object store, search and sharing. This paper will present a survey about it’s recent. First, we will introduce a simple definition of P2P, and define some common operation procedures in P2P. Second, P2P performance metric will be discussed in order to understand and differentiated the practical P2P architectures and protocols. Third, t...

This paper describes and analyzes a probabilistic technique to reduce the memory requirement of the table of reached states maintained in veriication by explicit state enumeration. The memory savings of the new scheme come at the price of a certain probability that the search becomes incomplete. However, this probability can be made negligibly small by using typically 40 bits of memory per stat...

SASC (Server-Aided Secret Computation) protocols enable a client (a smart card) to borrow computing power from a server (e.g., an untrustworthy auxiliary device like an ATM) without revealing its secret information. In this paper, we propose a new active attack on server-aided secret computation protocols. We describe our attack by using Beguin and Quisquater’s protocol. (We modify the protocol...

For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is executed. In some cases, this information may be attached to the specification; however, this is not always the case. In this paper, we present an algorithm for deriving characterisations of protocols. These characterisa...

Mass spectrometry (MS) instruments and experimental protocols are rapidly advancing, but the software tools to analyse tandem mass spectra are lagging behind. We present a database search tool MS-GF+ that is sensitive (it identifies more peptides than most other database search tools) and universal (it works well for diverse types of spectra, different configurations of MS instruments and diffe...

Recently, numerous service discovery protocols have been introduced in the open literature. Unfortunately, many of them did not consider security issues, and for those that did, many security and privacy problems still remain. One important issue is to protect the privacy of a service provider while enabling an end-user to search an alternative service using multiple keywords. To deal with this...

The present paper reports an experimental test of a prototype graphic and textual search interface for a university database on art-resource works. Novice and expert searchers were tested on both interfaces with performance assessed in terms of search speed and accuracy. Verbal protocols and navigation strategies were also examined. Experts performed significantly faster than novices though bot...