به نام خدا
Title: Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer
Authors: WengLong Chang Kawuu Weicheng Lin JuChin Chen ChihChiang Wang Lai Chin Lu Minyi Guo Michael ShanHui Ho
Abstract: The RSA public-key cryptosystem is an algorithm that converts a plain-text to its corresponding cipher-text, and then converts the cipher-text back into itscorresponding plain-text. In this article, we propose five DNA-based algorithms-parallel adder, parallel subtractor, parallel multiplier, parallel comparator, and parallelmodular arithmetic-that construct molecular solutions for any (plain-text, cipher-text) pair for the RSA public-key cryptosystem.
Publish Year: 2012
Published in: The Journal of Supercomputing - Springer
موضوع: رمزنگاری کلید عمومی (Public Key Cryptography)، محاسبات کوانتوم (Quantum Computing)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Secure E-Commerce Protocol for Purchase of e-Goods - Using Smart Card
Authors: Devane, S.; Chatterjee, M.; Phatak, D.
Abstract: The rapid growth of e-commerce for buying and selling electronic goods or intangible goods has necessitated the need for development of a number of e-commerce protocols, which ensure integrity, confidentiality, atomicity and fair exchange. In this paper we propose an e-commerce protocol for performing business over the Internet. The protocol uses a smart card for ensuring mutual authentication, dispute resolution and fair exchange and reduces reliance on a trusted third party. Atomicity is also maintained in the protocol.
Publish Year: 2007
Published by: IAS – IEEE
موضوع: تجارت الکترونیک (Electronic Commerce)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Sharding Social Networks
Authors: Quang Duong, Sharad Goel, Jake Hofman, Sergei Vassilvitskii
Abstract: Online social networking platforms regularly support hun-dreds of millions of users, who in aggregate generate sub-stantially more data than can be stored on any single phys-ical server. As such, user data are distributed, or sharded,across many machines. A key requirement in this setting israpid retrieval not only of a given user_s information, butalso of all data associated with his or her social contacts,suggesting that one should consider the topology of the so-cial network in selecting a sharding policy. In this paperwe formalize the problem of efficiently sharding large so-cial network databases, and evaluate several sharding strate-gies, both analytically and empirically. We find that randomsharding-the de facto standard-results in provably poorperformance even when frequently accessed nodes are repli-cated to many shards. By contrast, we demonstrate that onecan substantially reduce querying costs by identifying andassigning tightly knit communities to shards. In particular,our theoretical analysis motivates a novel, scalable shardingalgorithm that outperforms both random and location-basedsharding schemes.
Publish Year: 2013
Published by: ACM-WSDM
موضوع: شبکه های اجتماعی (Social Netwroks)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Efficient and dynamic key management for multiple identities in identity-based systems
Authors: Hua Guo , Chang Xu a , Zhoujun Li a , Yanqing Yao a , Yi Mu
Abstract: The traditional identity-based cryptography requires a user, who holds multiple identities, to hold multiple private keys, where each private key is associated with an identity. Man- aging multiple private/public keys is a heavy burden to a user due to key management and storage. The recent advancement of identity-based cryptography allow a single private key to map multiple public keys (identities); therefore the private key management is simpli- fied. Unfortunately, the existing schemes capturing this feature do not allow dynamic changes of identities and have a large data size proportional to the number of the associ- ated identities. To overcome these problems, in this paper, we present an efficient and dynamic identity-based key exchange protocol and prove its security under the Bilinear Diffie Hellman assumption in the random oracle model. Our protocol requires a relatively small bandwidth for a key agreement communication, in comparison with other existing schemes.
Publish Year: 2013
Published in: Information Sciences - Science Direct
موضوع: رمزنگاری
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Using the idea of the sparse representation to perform coarse- to-fine face recognition
Authors: Yong Xu , Qi Zhu a , Zizhu Fan , David Zhang d , Jianxun Mi a , Zhihui Lai
Abstract: In this paper, we propose a coarse-to-fine face recognition method. This method consists of two stages and works in a similar way as the well-known sparse representation method. The first stage determines a linear combination of all the training samples that is approximately equal to the test sample. This stage exploits the determined linear combination to coarsely determine candidate class labels of the test sample. The second stage again deter- mines a weighted sum of all the training samples from the candidate classes that is approximately equal to the test sample and uses the weighted sum to perform classification. The rationale of the proposed method is as follows: the first stage identifies the classes that are far from the test sample and removes them from the set of the training samples. Then the method will assign the test sample into one of the remaining classes and the classification problem becomes a simpler one with fewer classes. The proposed method not only has a high accuracy but also can be clearly interpreted.
Publish Year: 2013
Published in: Information Sciences - Science Direct
موضوع: شناسایی چهره (Face Detection)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان