Search

Public key encryption with keyword search (PEKS) is a cryptographic primitive that allows a secure search for desired keywords of data users by a cloud server using a search token. To the best of our knowledge, we propose the first practical, semantic secure, and post-quantum PEKS scheme based on rank metric codes. The proposed scheme is secure against keyword guessing attack, reaction attack, and key exposure, and enjoys conjunctive keyword search, verifiability of search results using Bloom filter and garbled Bloom filter. We implement the scheme with C++ programming language on a desktop computer. At the security level of 256 bits, the scheme performs all the necessary steps for encryption, keyword search, and verification of search results for one keyword in 22.5 milliseconds. Furthermore, the public key length at this security level is about 5 kilobytes. We show that the scheme is more efficient than the existing relevant post-quantum ones. [Display omitted] • A public key with keyword search scheme based on rank metric codes is proposed. • The scheme is secure under chosen keyword, keyword guessing, and reaction attacks. • The scheme is secure against quantum processors, having a small public key. • The scheme supports the verifiability of search results and conjunctive keyword search. [ABSTRACT FROM AUTHOR]

Lattice-based cryptosystems have recently acquired much importance. In this work, we construct a fuzzy identity based signature (FIBS) scheme based on the Small Integer Solution (SIS) Problem. FIBS schemes allow a user with identity id to issue a signature which could be verified under identity id′ if and only if id and id′ are close to each other. To our best knowledge, no lattice based FIBS schemes were known before, and the existing security model of FIBS schemes is not correct indeed. We propose a modified security model and prove that our scheme is existentially unforgetable against adaptively chosen message and identity attacks in the random oracle model. To break the bottleneck of designing lattice-based FIBS scheme, the secret key of each identity bit is generated by employing the Bonsai Tree techniques in the fuzzy extract algorithm. We also use some techniques to prove its security. Then we show the performance comparisons of all existing FIBS schemes. Finally, we give its application in biometric authentication. [ABSTRACT FROM AUTHOR]

In distributed systems, user authentication schemes based on password and smart card are widely used to ensure only authorized access to the protected services. Recently, Chang et al. presented an untraceable dynamic-identity-based user authentication scheme with verifiable-password-update. In this research, we illustrate that Chang et al.'s scheme violates the purpose of dynamic-identity contrary to authors' claim. We show that once the smart card of an arbitrary user is lost, passwords of all registered users are at risk. Using information from an arbitrary smart card, an adversary can impersonate any user of the system. In addition, its password change phase has loopholes and is misguiding. The scheme has no provision for session key agreement and the smart card lacks any verification mechanism. Then we come-up with an improved remote user authentication scheme with the session key agreement, and show its robustness over related schemes. [ABSTRACT FROM AUTHOR]

All regular cryptographic schemes rely on the security of the secret key. However, with the explosive use of some relatively insecure mobile devices, the key exposure problem has become more aggravated. In this paper, we propose an efficient forward secure identity-based signature (FSIBS) scheme from lattice assumption, with its security based on the small integer solution problem (SIS) in the random oracle model. Our scheme can guarantee the unforgeability of the past signatures even if the current signing secret key is revealed. Moreover, the signature size and the secret key size of our scheme are unchanged and much shorter. To the best of our knowledge, our construction is the first FSIBS scheme based on lattice which can resist quantum attack. Furthermore, we extend our FSIBS scheme to a forward secure identity-based signature scheme in the standard model. [ABSTRACT FROM AUTHOR]

Abstract: Cloud computing poses many challenges on integrity and privacy of users’ data though it brings an easy, cost-effective and reliable way of data management. Hence, secure and efficient methods are needed to ensure integrity and privacy of data stored at the cloud. Wang et al. proposed a privacy-preserving public auditing protocol in 2010 but it is seriously insecure. Their scheme is vulnerable to attacks from malicious cloud server and outside attackers regarding to storage correctness. So they proposed a scheme in 2011 with an improved security guarantee but it is not efficient. Thus, in this paper, we proposed a scheme which is secure and with better efficiency. It is a public auditing scheme with third party auditor (TPA), who performs data auditing on behalf of user(s). With detail security analysis, our scheme is proved secure in the random oracle model and our performance analysis shows the scheme is efficient. [Copyright &y& Elsevier]

Abstract: Video summarization is an integral component of video archiving systems. It provides small versions of the videos that are suitable for enhancing browsing and navigation capabilities. A popular method to generate summaries is to extract a set of key frames from the video, which conveys the overall message of the video. This paper introduces a novel feature aggregation based visual saliency detection mechanism and its usage for extracting key frames. The saliency maps are computed based on the aggregated features and motion intensity. A non-linear weighted fusion mechanism combines the two saliency maps. On the resultant map, a Gaussian weighting scheme is used to assign more weight to the pixels close to the center of the frame. Based on the final attention value of each frame, the key frames are extracted adaptively. The experimental results, based on different evaluation standards, demonstrate that the proposed scheme extracts semantically significant key frames. [Copyright &y& Elsevier]

Highlights: [•] Highly robust and blind color image watermarking scheme. [•] Only the person who has a valid secret key and a user-id can prove the rightful ownership of the image. [•] Impossible for any attacker to compute the secret key from the watermarked image. [•] Robustness is achieved by embedding the watermark in the contourlet domain. [•] Imperceptibility is achieved by embedding the watermark in less correlated sub bands. [Copyright &y& Elsevier]

Highlights: [•] Introduced the combination operation on permutations and proved its properties. [•] Proposed an effective method to generate large permutation based on combination. [•] Proposed an image encryption scheme based on large permutation and diffusion. [•] The proposed encryption scheme has high security and significant speed advantage. [Copyright &y& Elsevier]

Abstract: Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In 2009, Yu et al. proposed an identity-based signcryption scheme in the standard model. In 2010, Jin et al. pointed out that Yu et al.’s scheme cannot achieve the semantic security and proposed an improved identity-based signcryption scheme. They proved that the improved scheme is semantically secure in the standard model. Recently, Li et al. showed that the Jin-et al.’s scheme cannot achieve the semantic security and existential unforgeability. To remedy the weaknesses of the Jin-et al.’s scheme, we give a further improvement in this paper. Our scheme satisfies semantic security and existential unforgeability. [Copyright &y& Elsevier]

Abstract: Stored-value cards (SVCs) are a kind of smartcards that can be used to store monetary values. SVCs have demonstrated a wide range of applications in commerce. SVCs are in general tamper-resistant, but they are very computationally weak and their security mechanisms are also weak against side-channel attacks. In this paper, we propose an efficient and secure stored-value card system. With the help of pre-computations, stored-value cards in our scheme are only required to perform simple arithmetic operations and bitwise comparisons. Our system especially for SVCs is secure with unbounded computational leakage resilience. Our novel scheme provides a practical solution to side-channel attacks for light-weight devices. [Copyright &y& Elsevier]

Abstract: In 2009, Wang et al. presented a dynamic ID-based remote user authentication scheme and claimed that their scheme was more efficient and secure. In this paper, we point out that their scheme is not secure against impersonation attacks launched by any adversary at anytime and could leak some key information to legal users, who can launch an off-line guessing attack. If the adversary could get the secret information stored in the smart cards someway, their scheme will be completely broken down. In addition, their scheme does not provide anonymity for the users, and lacks the functionalities of revocation, key exchange and secret renew for users and servers. Furthermore, we propose a more secure and robust scheme, which does not only cover all the above security flaws and weaknesses, but also provides more functionalities. [Copyright &y& Elsevier]

Abstract: There have been numerous techniques proposed in the literature that aim to improve the performance of cache memories by reducing cache conflicts. These techniques were proposed over the past decade and each proposal independently claimed to reduce conflict misses. However, because the published results used different benchmarks and different experimental setups, it is not easy to compare them. In this paper we report a side-by-side comparison of these techniques. We also evaluate the suitability of some of these techniques for caches with higher set associativities. In addition to evaluating techniques for their impact on cache misses and average memory access times, we also evaluate the techniques for their ability in reducing the non-uniformity of cache accesses. The conclusion of our work is that, each application may benefit from a different technique and no single scheme works universally well for all applications. We also observe that, for the majority of applications, XORing (XOR) and Odd-multiplier indexing schemes perform reasonably well. Among programmable associativity techniques, B-cache performs better than column-associative and adaptive-caches, but column-associative caches require very minimal extensions to hardware. Uniformity of cache accesses is improved most by B-cache technique while column-associative cache also improves cache access uniformities. Based on the observation that different techniques benefit different applications, we explored the use of multiple, programmable addressing mechanisms, each addressing scheme designed for a specific application. We include some preliminary data using multiple addressing schemes. [Copyright &y& Elsevier]

Abstract: F5 steganography is much different from most of LSB replacement or matching steganographic schemes, because matrix encoding is employed to increase embedding efficiency while reducing the number of necessary changes. By using this scheme, the hidden message inserted into carrier media imperceptibly can be transferred via a more secure subliminal channel. The embedding domain is the quantized DCT coefficients of JPEG image, which makes the scheme be immune to visual attack and statistical attack from the steganalyst. Based on this effective scheme, an extended matrix encoding algorithm is proposed to improve the performance further in this paper. By changing the hash function in matrix encoding and converting the coding mode, the embedding efficiency and embedding rate get increased to a large extent. Eventually, the experimental results demonstrate the extended algorithm is superior to the classic F5 steganography. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a novel self-recovery watermarking scheme based on dual-redundant-ring structure (DRRS). All blocks of target image form a ring in a manner that the watermark of an image block is hidden in 1-LSB (least significant bit) of its next block N 1, and the copy of this watermark is embedded into 2-LSB of another block whose position is determined by the position of N 1. The validity of test image block is determined by comparing the number of inconsistent blocks in the block-neighborhood with that of its mapping block. Other detection result is generated in the same way comparing test block with copy block of its next block. The fusion of two detection marks improves tamper detection accuracy, while two copies of watermark provide a second chance for tamper recovery. Experimental results demonstrate that the proposed algorithm is superior to the state of the art of tamper detection and tamper recovery and could keep high security strength. [Copyright &y& Elsevier]

Abstract: To protect the remote server from various malicious attacks, many authentication schemes have been proposed. Some schemes have to maintain a password verification table in the remote server for checking the legitimacy of the login users. To overcome potential risks of verification tables, researchers proposed remote user authentication schemes using smartcard, in which the remote server only keeps a secret key for computing the user’s passwords and does not need any verification table for verifying legal user. In 2003 Shen, Lin, and Hwang proposed a timestamp-based password authentication scheme using smartcards in which the remote server does not need to store the passwords or verification table for user authentication. Unfortunately, this scheme is vulnerable to some deadly attacks. In this paper, we analyze few attacks and finally propose an improved timestamp-based remote user authentication scheme. The modified scheme is more efficient and secure than original scheme. [Copyright &y& Elsevier]

Abstract: ECC combined public key is a new technology of scalable key management. In this paper, we propose an identity-based encryption (IBE) scheme using ECC combined public key (CPK). The scheme is based on bilinear maps between groups and proved semantically secure in the random oracle model under a variant of Computational Diffie-Hellman (CDH) assumption–Bilinear Diffie-Hellman (BDH) assumption. [ABSTRACT FROM AUTHOR]

Abstract: A new scheme of test data compression/decompression, namely coding of even bits marking and selective output inversion, is presented. It first uses a special kind of codewords, odd bits of which are used to represent the length of runs and even bits of which are used to represent whether the codewords finish. The characteristic of the codewords make the structure of decompressor simple. It then introduces a structure of selective output inversion to increase the probability of 0s. This scheme can obtain a better compression ratio than some already known schemes, but it only needs a very low hardware overhead. The performance of the scheme is experimentally confirmed on the larger examples of the ISCAS89 benchmark circuits. [ABSTRACT FROM AUTHOR]

Abstract: Recently, Kang et al. proposed a new identity-based strong designated verifier signature scheme (ID-SDVS) and identity-based designated verifier proxy signature scheme (ID-DVPS). They claimed that their schemes are unforgeable. However, we found out that their schemes are universally forgeable in the sense that anyone can forge valid ID-SDVS and ID-DVPS on an arbitrary message without the knowledge of the secret key of either the signer or the designated verifier. Finally, we propose an improved ID-SDVS which is unforgeable. We give formal security proof of universal unforgeability of our scheme. We also give an improved ID-DVPS. [ABSTRACT FROM AUTHOR]

Abstract: As indicated in the latest version of ITRS roadmap, optical wiring is a viable interconnect technology for future SoC/SiC/SiP designs that can provide broad band data transfer rates unmatchable by the existing metal/low-k dielectric interconnects. In this paper, we present an interconnection architecture, referred as the wavelength routed optical network (WRON), suitable to build on-chip optical micro-networks. The routing scheme for WRON, using any two of the three routing parameters (the source node address, the destination node address, and the routing wavelength), is generalized in this paper. With WRON as the primitive platform, we further propose a new recursive architecture, the recursive wavelength routed optical network (RCWRON), and it serves as the basis of a redundant architecture, the redundant wavelength routed optical network (RDWRON). The routing schemes for RCWRON and RDWRON are also detailed in this paper. [Copyright &y& Elsevier]

Abstract: In this paper, we present a routing algorithm that combines the shortest path routing and adaptive routing schemes for NoCs. In specific, routing follows the shortest path to ensure low latency and low energy consumption. This routing scheme requires routing information be stored in a series of routing tables created at the routers along the routing path from the source to the destination. To reduce the exploration space and timing cost for selecting the routing path, a routing list and routing table for each node are created off-line. Routing table is updated on-line to reflect the dynamic change of the network status to avoid network congestion. To alleviate the high hardware implementation cost associated with the routing tables, a method to help reduce the size of the routing tables is also introduced. Compared to the existing routing algorithms, the experimental results have confirmed that the proposed algorithm has better performance in terms of routing latency and power consumption. [Copyright &y& Elsevier]