3145299
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for $\mathcal{NP}$ in BPK model without assuming \emph{sub-exponential hardness}? We give a positive answer to this question by presenting such a protocol for any language in $\mathcal{NP}$ in the bare public-key model assuming only collision-resistant hash functions against \emph{polynomial-time} adversaries.
280798
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
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 [23] with a special public key, which is generated via a (possibly)interactiveprotocol and contains an instance y? L? {0,1}*for a specific NP language L, but the security requirements on such a function are relaxed: we only require the pseudorandomnessproperty when y? Land only require the uniquenessproperty when y? L, instead of requiring both pseudorandomness and uniqueness to hold simultaneously. We show that this notion can be realized under standard assumption. 
 
Our motivation is the conjecture posed by Barak et al.[2], which states there exist resettably-sound resettable zero knowledge arguments for NP. The instance-dependent verifiable random functions is a powerful tool to tackle this problem. We first use them to obtain two interesting instance-dependent argument systems from the Barak's public-coin bounded concurrent zero knowledge argument [1], and then, we 
 
 1 Construct the first(constant round) zero knowledge arguments for NP enjoying a certainsimultaneous resettability under standard hardness assumptions in the plain model, which we call bounded-class resettable ZK arguments with weak resettable-soundness Though the malicious party (prover or verifier) in such system is limited to a kind of bounded resetting attack, We put NO restrictions on the number of the total resets made by malicious party. 
 1 show that, under standard assumptions, if there exist public-coin concurrent zero knowledge arguments for NP, there exist the resettably-sound resetable zero knowledge arguments for NP.
26482984
Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
In this paper we present the firstconstant round resettable zero knowledge arguments with concurrent soundness for $\mathcal{NP}$ in the bare public-key (BPK for short) model assuming only collision-resistant hash functions against polynomial-timeadversaries. This resolves the problem whether there exist such protocols for $\mathcal{NP}$ in BPK model without assuming sub-exponential hardness. In our protocol, the resettable zero knowledge is demonstrated via a black-box simulator, while the concurrent soundness is proved by using the malicious prover strategy in non-black-boxmanner.
29420806
Strengthening QIM-Based Watermarking by Non-uniform Discrete Cosine Transform
Being extremely precise and at a low loss of perceptual quality, the attacks of value modification and optimized noise reduction still threaten the watermarking based on quantization index modulation (QIM). To resist them, the paper constructs a non-uniform discrete cosine transform (NDCT), and brings out an NDCT-QIM watermarking scheme, which embeds a watermark in a private NDCT domain with the parameters of NDCT as a secret key. The technique blinds the value modification by dispersing the attacking signal and changing its energy in the embedded domain. Because of the variable power spectrum of a watermark, the noise reduction becomes non-optimal. Some other advantages, including the ease of embedding, computational simplicity, etc., can also be acquired or maintained by the use of NDCT.
1196454
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zero-knowledge proofs, where the protocol must be zero-knowledge even if a cheating verifier can reset the prover and have several interactions in which the prover uses the same random tape. Soon afterwards, Barak, Goldreich, Goldwasser, and Lindell (FOCS 2001) studied the closely related notion of resettable soundness, where the soundness condition of the protocol must hold even if the cheating prover can reset the verifier to have multiple interactions with the same verifier's random tape. The main problem left open by this work was whether it is possible to have a single protocol that is simultaneously resettable zero knowledge and resettably sound. We resolve this question by constructing such a protocol. At the heart of our construction is a new non-black-box simulation strategy, which we believe to be of independent interest. This new strategy allows for simulators which "marry'' recursive rewinding techniques (common in the context of concurrent simulation) with non-black-box simulation. Previous non-black-box strategies led to exponential blowups in computational complexity in such circumstances, which our new strategy is able to avoid.
30407300
A G-Net Model for Knowledge Representation and Reasoning
The G-net model for G-type knowledge representation is introduced. It is capable of modeling both static semantic knowledge and dynamic control knowledge, combining them into a loosely coupled, mixed-type knowledge hierarchy. Four reasoning algorithms for the G-net model are proposed: inheritance reasoning and recognition reasoning for semantic knowledge, event-driven reasoning for dynamic knowledge, and control table reasoning for coordination and control in a mixed-type knowledge hierarchy. Based on the knowledge-table representation, the G-net model expresses the constraints and relationships among knowledge objects explicitly so that reasoning algorithms can be implemented efficiently. Applications to information systems prototyping are discussed. >
7501117
Characterization of virus replication
New viruses spread faster than ever and current signature based detection do not protect against these unknown viruses. Behavior based detection is the currently preferred defense against unknown viruses. The drawback of behavior based detection is the ability only to detect specific classes of viruses or have successful detection under certain conditions plus false positives. This paper presents a characterization of virus replication which is the only virus characteristic guaranteed to be consistently present in all viruses. Two detection models based on virus replication are developed, one using operation sequence matching and the other using frequency measures. Regression analysis was generated for both models. A safe list is used to minimize false positives. In our testing using operation sequence matching, over 250 viruses were detected with 43 subsequences. There were minimal false negatives. The replication sequence of just one virus detected 130 viruses, 45% of all tested viruses. Our testing using frequency measures detected all test viruses with no false negatives. The paper shows that virus replication can be identified and used to detect known and unknown viruses.
10300241
Efficient algorithms for detection and resolution of distributed deadlocks
We present a simple and efficient distributed algorithm for detecting generalised deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-for graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an "image" of the WFG at an initiator node. The algorithm has time complexity of d+1 and message complexity of e+n, where n is the number of nodes, d the diameter, and e the number of edges of the WFG. Compared with the best existing algorithm, our algorithm notably reduces both time and message complexities. Correctness proof and performance analysis for the algorithm are provided. In addition, the new approach simplifies deadlock resolution. An extension to the algorithm is presented to handle generalized-deadlock resolution with only a slight increase to the message complexity.
7511542
Towards a business continuity information network for rapid disaster recovery
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities such as the terrorist attacks of September 11th 2001 and hurricanes/earthquakes i.e. Katrina (2005), Wilma (2005) and Indian Ocean Tsunami (2004). Most of the recent work has been conducted for crisis management under terrorist attacks and emergency management services under natural disasters with private business continuity and disaster recovery a secondary concern. In this paper, we propose a model for pre-disaster preparation and post-disaster business continuity/rapid recovery. The model is utilized to design and develop a web based prototype of our Business Continuity Information Network (BCIN) system facilitating collaboration among local, state, federal agencies and the business community for rapid disaster recovery. We present our model and prototype with Hurricane Wilma as the case study.