Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Science and Technology Studies

Selected Works

Identity

Articles 1 - 4 of 4

Full-Text Articles in Social and Behavioral Sciences

Identity Awareness And Re-Use Of Research Data In Veillance And Social Computing, Alexander Hayes, Stephen Mann, Amir Aryani, Susannah Sabine, Leigh Blackall, Pia Waugh, Stephan Ridgway Jun 2015

Identity Awareness And Re-Use Of Research Data In Veillance And Social Computing, Alexander Hayes, Stephen Mann, Amir Aryani, Susannah Sabine, Leigh Blackall, Pia Waugh, Stephan Ridgway

Alexander Hayes Mr.

Identity awareness of research data has been introduced as a requirement for open research, transparency and reusability of research data in the context of eScience. This requirement includes the capability of linking research data to researchers, research projects and publications, and identifying the license for the data. This connectivity between research data and other elements in research ecosystems is required in order to make the data available and reusable beyond the initial research. In this paper, we examine these capabilities in the domains of veillance and social computing. The dataset cases presented in this paper articulate the challenges that researchers …


Identity Based Identification From Algebraic Coding Theory, Guomin Yang, Chik How Tan, Yi Mu, Willy Susilo, Duncan S. Wong Mar 2014

Identity Based Identification From Algebraic Coding Theory, Guomin Yang, Chik How Tan, Yi Mu, Willy Susilo, Duncan S. Wong

Professor Willy Susilo

Cryptographic identification schemes allow a remote user to prove his/her identity to a verifier who holds some public information of the user, such as the user public key or identity. Most of the existing cryptographic identification schemes are based on number-theoretic hard problems such as Discrete Log and Factorization. This paper focuses on the design and analysis of identity based identification (IBI) schemes based on algebraic coding theory. We first revisit an existing code-based IBI scheme which is derived by combining the Courtois-Finiasz-Sendrier signature scheme and the Stern zero-knowledge identification scheme. Previous results have shown that this IBI scheme is …


Identity-Based Mediated Rsa Revisited, Ibrahim Elashry, Yi Mu, Willy Susilo Mar 2014

Identity-Based Mediated Rsa Revisited, Ibrahim Elashry, Yi Mu, Willy Susilo

Professor Willy Susilo

In SSYM 2001, Boneh, Ding, Tsudik and Wong presented encryption and signature schemes based on the identity-based mediated RSA (ID-MRSA), in which the users are not allowed to decrypt/sign messages without the permission of a security mediator (the SEM). This allows a simple key revocation. Subsequently, in CT-RSA 2003, Ding and Tsudik presented a security proof for these schemes. In particular, they stated that 'IB-mRSA/OAEP encryption offers equivalent the semantic security to RSA/OAEP against adaptive chosen ciphertext attacks in the random oracle model if the key generation function is division intractable'. To make the key generation function division intractable, Ding …


Identity-Based Multisignature With Message Recovery, Kefeng Wang, Yi Mu, Willy Susilo Mar 2014

Identity-Based Multisignature With Message Recovery, Kefeng Wang, Yi Mu, Willy Susilo

Professor Willy Susilo

We present a new notion of short identity-based multisignature scheme with message recovery. We propose a concrete identity-based multisignature with message recovery scheme based on bilinear pairing in which multiple signers can generate a constant size multisignature on same message regardless of the number of signers. There is no requirement to transmit the original message to the verifier, since the original message can be recovered from the multisignature. Therefore, this scheme minimizes the total length of the original message and the appended multisignature. The proposed scheme is proven to be existentially unforgeable against adaptively chosen message attacks in the random …