Titlebook: Information Security Practice and Experience; Third International Ed Dawson,Duncan S. Wong Conference proceedings 2007 Springer-Verlag Ber

Innovative

A Sanitizable Signature Scheme with Aggregation on a sanitizable signature proposed by Izu et al, by applying the general aggregate signature by Boneh et al. We also propose some efficiency improvements on the proposed scheme by reducing the number of hash values required as verifiers’ input.

Aura231

价值在贬值

Bureaucracy

A Novel Verifiably Encrypted Signature Scheme Without Random Oracleeme has the following advantages: (1) short signature size, only 320 bits; (2)low computation, only 2 pairing operations are needed in the phase of producing and verifying verifiably encrypted signature, respectively. (3)simplification-ability, the creation of verifiably encrypted signature is able to be completed in a logic step.

chandel

违抗

Formalization of RBAC Policy with Object Class Hierarchyity to model object classes, and class hierarchies used to restrict the validity and to control the propagation of authorization rules. We also demonstrate how access control decisions are made by tableaux, considering role and class hierarchies.

开始发作

Two-Party Privacy-Preserving Agglomerative Document Clustering document clustering among the users under the distributed environment: two parties, each having his private documents, want to collaboratively execute agglomerative document clustering without disclosing their private contents.

充气女

How to Prevent DPA and Fault Attack in a Unified Way for ECC Scalar Multiplication – Ring Extension he definition field of an elliptic curve to its random extension ring and performing the required elliptic curve operations over the ring. Moreover, new methods perform a point validation check in a small subring of the extension ring to give an efficient fault attack countermeasure.

和谐

Related-Key Rectangle Attack on 43-Round SHACAL-2 a related-key rectangle attack on the 42-round SHACAL-2 [13]. In this paper we present a related-key rectangle attack on 43-round out of the 64-round of SHACAL-2, which requires 2. chosen plaintexts and has time complexity of 2. 43-round SHACAL-2 encryptions. In this paper we also identify and fix some flaws in previous attack on SHACAL-2.

plasma-cells