Creat membership Creat membership
Sign in

Forgot password?

  • Forgot password?
    Sign Up
  • Confirm
    Sign In
home > search

Now showing items 1 - 16 of 24


    A method for performing a fuzzy search in encrypted data includes receiving an encrypted search token corresponding to a search keyword with an untrusted server computing device and generating inner product values based on a function-hiding inner product encryption operation of the encrypted query vectors encrypted node vectors in an encrypted tree stored in the memory of the untrusted server computing device. The method further includes transmitting, with the untrusted server computing device, the encrypted keyword stored in the leaf node to a client computing device in response to the first inner product value exceeding a first predetermined similarity threshold corresponding to a similarity of the first query vector to the leaf node vector, the fuzzy search not revealing plaintext contents for any of a keyword stored in the leaf node, the search keyword, or a fuzziness parameter.
    Download Collect

    A searchable symmetric encryption (SSE) system and method of processing inverted index is provided. The SSE system includes genKey, buildSecurelndex, genToken, and search operations. A compress X is integrated into at least one of the buildSecurelndex and search operations. The compress then X takes each entry of an encrypted index, compresses entry of the encrypted index into a compressed entry, and then processes the compressed entry with a function. The function comprises a linked list function and an array function. The search operation decompresses the processed entry and output the decompressed entry. The SSE comprises a client device and a server. The genKey, buildSecurelndex, and genToken operations are integrated into the client device and the search operation is integrated into the server.
    Download Collect

    A method for searching encrypted data includes identifying, with a client, a plurality of values within a predetermined search range in a search index stored within a memory of the client, each value in the plurality of values being present in a plaintext representation of at least one encrypted file in a plurality of encrypted files stored in a server. The method further includes generating and transmitting at least one search query to the server through a data network, and receiving, with the client, at least one response from the server through the data network, the response including the encrypted keyword corresponding to the value in the plurality of values and an identifier of at least one file in the plurality of encrypted files stored on the server that includes the value.
    Download Collect
  • Good Clinical Outcomes in Budd–Chiari Syndrome with Hepatic Vein Occlusion

    Fan, Xinxin   Liu, Kai   Che, Yuan   Wang, Shikai   Wu, Xingjiang   Cao, Jianmin   Li, Jieshou  

    Download Collect
  • Investigation of an Optimized Protocol for Brucine-Induced Seizure Model

    Fan, Xinxin  

    Download Collect
  • Peer cluster: a maximum flow-based trust mechanism in P2P file sharing networks

    Fan, Xinxin   Li, Mingchu   Zhao, Hui   Chen, Xiaodong   Guo, Zhenzhou   Jiao, Dong   Sun, Weifeng  

    Trust mechanism has become a research focus in recent years as a novel and valid way to ensure the transaction security in peer-to-peer file sharing networks. Nevertheless, some fundamental challenges still exist, for example: How can malicious peers be effectively isolated? How can various threats of manipulation by strategic peers be resisted? What strategy should be used to ensure that the service providers are authentic peers? Considering these challenges in our minds, in this paper, we propose a new trust mechanism based on the maximum flow theory. We firstly add a few prestigious peers into a cluster as the original members according to their transaction behaviors in a period; then, we perform maximum flow algorithm and identify those peers that still link from (to) the peers in the cluster as new members, which is carried out repeatedly, and almost every normal peer would finally become the member of the cluster. Each request peer has the priority to select downloading sources from this cluster according to our trust mechanism. In this way, the malicious peers are isolated, and their transaction behaviors are also confined largely even though they have high reputation. Extensive experimental results confirm the efficiency of our trust mechanism against the threats of exaggeration, cheat, collusion, and disguise. Copyright (c) 2013 John Wiley & Sons, Ltd.
    Download Collect

    A method for verification of search results in an encrypted search process includes transmitting a search query including the encrypted keyword from a client to a server, and receiving a response to the search query and a first plurality of hash values from at least one hash tree from the server. The method further includes generating, a first message authentication code (MAC) based on the response, generating a first regenerated root node hash value using the first MAC, the first plurality of hash values, and a predetermined hash function, and generating an output message with the client indicating that the response is invalid in response to the first regenerated root node hash value not matching a predetermined first root node hash value stored in the memory of the client.
    Download Collect
  • Opposite particle size effects on the adsorption kinetics of ZIF-8 for gaseous and solution adsorbates

    Fan, Xinxin   Zhou, Junwen   Wang, Teng   Zheng, Jie   Li, Xingguo  

    ZIF-8 shows complete opposite particle size effects on the adsorption kinetics for two different adsorbates. Smaller ZIF-8 particles favor fast I3− uptake in aqueous solution while larger, less defective ZIF-8 particles exhibit faster adsorption kinetics for gaseous H2, which suggests different adsorption mechanisms for the two adsorbates.
    Download Collect

    A method for shared key generation with authentication in a gateway node includes generating, generating a first set of pseudo-random data corresponding to expected transmissions from a first node that communicates with a second node through a shared communication medium, identifying, with the gateway node, bits transmitted from the second node based on a signals received by the gateway node corresponding to simultaneous transmissions from the first node and the second node, identifying, with the gateway node, expected bit values for the bits from the second node based on a combination of shared secret data stored in a memory of the gateway node with another set of random or pseudo-random data generated by the second node, and authenticating the second node in response to the plurality of bits transmitted from the second node matching the plurality of expected bit values.
    Download Collect
  • Multiple point compression on elliptic curves

    Fan, Xinxin   Otemissov, Adilet   Sica, Francesco   Sidorenko, Andrey  

    Download Collect

    A DSSE architecture network enables multi-user such as data owners and data users to conduct privacy-preserving search on the encrypted PHIs stored in a cloud network and verify the correctness and completeness of retrieved search results simultaneously is provided. The data owners and data users may be patients, HSPs, or combination thereof. An IoT gateway aggregates periodically collected data into a single PHI file, extract keywords, build an encrypted index, and encrypt the PHI files before the encrypted index and PHI files are transmitted to a cloud network periodically for storage thus enable the DSSE architecture network to achieve a sub-linear search efficiency and forward privacy by maintaining an increasing counter for each keyword at the IoT gateway. Since the PHI files are always transmitted and added/stored into the cloud storage over the cloud network, file deletion, file modification is eliminated. The cloud network therefore does not need to learn whether the newly stored PHI files contain specific keywords. Any number of HSPs such as data users provides healthcare services for the patient by searching, querying, and/or retrieving user's encrypted PHIs incrementally stored on the cloud network in a privacy and verifiable manner. The patient delegated verifiability is derived from a combination of a Bloom filter and aggregate message authentication code.
    Download Collect

    There is disclosed an apparatus and method for generating a keystream with ideal two-level autocorrelation, which can be efficiently implemented in both software and hardware on mobile devices requiring high security protection and in resource limited smart devices such as RFID chips. In one embodiment, a 16-bit Welch-Gong (WG) transformation is used as the filtering function, which is applied to 16-bit input values generated from a linear feedback shift register. In another embodiment, an 8-bit WG transformation is used which is applied to 8-bit input values generated from a linear feedback shift register.
    Download Collect
  • GroupTrust: Dependable Trust Management

    Fan, Xinxin   Liu, Ling   Li, Mingchu   Su, Zhiyuan  

    Download Collect
  • Highly Porous ZIF-8 Nanocrystals Prepared by a Surfactant Mediated Method in Aqueous Solution with Enhanced Adsorption Kinetics

    Fan, Xinxin   Wang, Wei   Li, Wei   Zhou, Junwen   Wang, Bo   Zheng, Jie   Li, Xingguo  

    ZIF-8 nanocrystals with a sub-100 nm size are prepared by a surfactant mediated method in aqueous solution. Pure ZIF-8 phase can be obtained with a stoichiometric Zn/2-methylimidazole ratio. The surfactant mixture of Span 80 and Tween 80 may stabilize the Zn/2-methylimidazole coordination structure and prevent the formation of the hydroxide or alkaline salt. The nanocrystals maintain a high specific surface area of 1360 m(2)/g. The particle size effect on the adsorption kinetics of the ZIF-8 nanocrystals is studied by using two different probing molecules (I-3(-) anion and Rhodamine B molecule). For the I-3(-) anion, which is smaller than the aperture size of ZIF-8, the ZIF-8 nanoparticles exhibit faster absorption kinetics compared to the bulk material. For the Rhodamine B molecule, which is larger than the aperture size of ZIF-8, only surface adsorption occurs. The enhanced adsorption kinetics of the ZIF-8 nanoparticles is attributed to the smaller particles size, which reduces the intraparticle diffusion length. ZIF-8 nanocrystals prepared by a surfactant mediated method in aqueous solution exhibit faster adsorption kinetics compared to the bulk material.
    Download Collect
  • Using different assumptions of aerosol mixing state and chemical composition to predict CCN concentrations based on filed measurement in Beijing

    Ren, Jingye   Zhang, Fang   Wang, Yuying   Fan, Xinxin   Jin, Xiaoai   Xu, Weiqi   Sun, Yele   Cribb, Maureen   Li, Zhanqing  

    Download Collect
  • [IEEE 2011 IEEE Globecom Workshops - Houston, TX, USA (2011.12.5-2011.12.9)] 2011 IEEE GLOBECOM Workshops (GC Wkshps) - A lightweight privacy-preserving mutual authentication protocol for RFID systems

    Fan, Xinxin   Gong, Guang   Engels, Daniel W.   Smith, Eric M.  

    Download Collect
1 2


If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

Submit Feedback