1,721,031 research outputs found
A Novel k-out-of-n Oblivious Transfer Protocol from Bilinear Pairing
No full textOblivious transfer (OT) protocols mainly contain three categories: 1-out-of-2 OT, 1-out-of-n OT, and k-out-of-n OT. In most cases, they are treated as cryptographic primitives and are usually executed without consideration of possible attacks that might frequently occur in an open network, such as an impersonation, replaying, or man-in-the-middle attack. Therefore, when used in certain applications, such as mental poker games and fair contract signings, some extra mechanisms must be combined to ensure the security of the protocol. However, after a combination, we found that very few of the resulting schemes are efficient enough in terms of communicational cost, which is a significant concern for generic commercial transactions. Therefore, we propose a novel k-out-of-n oblivious transfer protocol based on bilinear pairing, which not only satisfies the requirements of a k-out-of-n OT protocol, but also provides mutual authentication to resist malicious attacks. Meanwhile, it is efficient in terms of communication cost
A Novel Anonymous Proxy Signature Scheme
No full textRecently, several studies about proxy signature schemes have been conducted. In 2009, Yu et al. proposed an anonymous proxy signature scheme attempting to protect the proxy signer's privacy from outsiders. They claimed that their scheme can make the proxy signer anonymous. However, based on our research, we determined that this was not the case and the proxy signer's privacy was not anonymous. Hence, in this paper, we propose a new anonymous proxy signature scheme that truly makes the proxy signer anonymous while making it more secure and efficient when compared with Yu et al.'s scheme. Our proxy signature scheme consists of two contributions. First, we mainly use random numbers and bilinear pairings to attain the anonymous property. Secondly, we increase the security and efficiency of our proxy in the design
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
[[alternative]]Analysis of network security directed user authentication scheme using bilinear pairing over elliptic curves
No full text[[abstract]] 目前網際網路的使用率越來越普及，人們利用網路搜尋資料、傳遞訊息，所以位於不同的兩地資訊的交流就日益頻繁，自然網路安全就愈來愈受到各方的重視。，而透過密碼學的應用及加解密的機制，除可加強網際網路中資訊傳遞的私密性、完整性及不可否認性外，亦有效防止個人私密資訊遭受他人所竊取。近年來，橢圓曲線密碼學被證明擁有更高的安全性與更低的計算量並且發展出許多的加密系統，並廣泛應用於網路安全。 本論文指出在2005年由Manik提出的遠端使用者登入系統並非擁有如同作者所宣稱的安全性，惡意攻擊者可以任意扮演合法使用者並欺騙遠端伺服器達到登入目的。因此，本論文分析Manik的遠端使用者登入系統安全上的弱點並且修改它安全上的漏洞。[[abstract]] The information security with the internet has become a serious issue recently to us. In order to protect the transaction security, many cryptosystem has developed such as RSA which based on the complex discrete logarithm problem. Recently, bilinear pairings such as Weil pairing and Tate pairing defined on elliptic curves were proved and could be applied to cryptography in 2001. It possesses faster computation and fewer bits but remaining the same security level as other public key cryptosystems, like the traditional RSA cryptosystem. In this paper, we review some exist security attributes and point out the current cryptosystem based on bilinear pairings which proposed by Manik which has some weaknesses. After that, we proposed few improvement of their scheme
Comments on: EIBAS - an efficient identity broadcast authentication scheme in wireless sensor networks
Full text linkRecently, Shm et al. Proposed an efficient identity-based broadcast authentication scheme based on Tso et al.’s IBS scheme with message recovery to achieve security requirements in wireless sensor networks. They claim that their scheme can achieve security requirements and mitigated DOS attack by limiting the times of signature verification failures in wireless sensor networks (WSN). However, we found that the scheme cannot attain the security level as they claimed. We will demonstrate it in this article
Crypto-analyses on “secure and efficient privacy-preserving public auditing scheme for cloud storage”
Full text linkRecently, Worku et al. pointed out that the work “privacy-preserving public auditing for data storage security in cloud computing” proposed by Wang et al. is insecure and their second work “privacy- preserving public auditing for secure cloud the storage” is inefficient. Thus, they offered a secure and efficient-privacy public auditing scheme for cloud storage. They claimed that their system is provably secure in the random oracle model and the operation is effective. However, after crypto-analysis, we found that the scheme cannot reach the security goal, it has the existential forgery attack. We, therefore, alter it to incorporate the desired privacy preserving requirement, which is very significant in a privacy-preserving public auditing protocol for cloud storage
- …
