The Experts below are selected from a list of 1161 Experts worldwide ranked by ideXlab platform
Yu-min Wang - One of the best experts on this subject based on the ideXlab platform.
-
AINA (2) - Provably secure and ID-based group signature scheme
18th International Conference on Advanced Information Networking and Applications 2004. AINA 2004., 2004Co-Authors: Zewen Chen, Daren Huang, Jian Hong Zhang, Jiwu Huang, Yu-min WangAbstract:There are two important directions in group signature scheme: ID-based group signature scheme and provably secure group signature scheme. We first analyze the advantages and flaws of these two directions, and propose a provably secure ID-based group signature scheme basing on the ACJT group signature scheme. Compared with prior ID-Based group signature scheme, our scheme is provably secure in random oracle model. Compared with the ACJT scheme, our scheme is ID-Based and strong Nonrepudiation.
-
AINA (2) - An improved nominative proxy signature scheme for mobile communication
18th International Conference on Advanced Information Networking and Applications 2004. AINA 2004., 2004Co-Authors: Jian Hong Zhang, Qianhong Wu, Jilin Wang, Yu-min WangAbstract:Recently, Seung-Hyun et al proposed a nominative proxy signature scheme for mobile communication. However, we show that the scheme hasn't Nonrepudiation, note that a malicious original signer can forge the proxy signer to sign on any message. Finally, we also present a modification of the scheme to repair the security flaw.
-
Provably secure and ID-based group signature scheme
18th International Conference on Advanced Information Networking and Applications 2004. AINA 2004., 2004Co-Authors: Zewen Chen, Daren Huang, Jian Hong Zhang, Yu-min WangAbstract:There are two important directions in group signature scheme: ID-based group signature scheme and provably secure group signature scheme. We first analyze the advantages and flaws of these two directions, and propose a provably secure ID-based group signature scheme basing on the ACJT group signature scheme. Compared with prior ID-Based group signature scheme, our scheme is provably secure in random oracle model. Compared with the ACJT scheme, our scheme is ID-Based and strong Nonrepudiation.
Javier Lopez - One of the best experts on this subject based on the ideXlab platform.
-
multiparty Nonrepudiation a survey
ACM Computing Surveys, 2009Co-Authors: Jose A Onieva, Jianying Zhou, Javier LopezAbstract:Nonrepudiation is a security service that plays an important role in many Internet applications. Traditional two-party Nonrepudiation has been studied intensively in the literature. This survey focuses on multiparty scenarios and provides a comprehensive overview. It starts with a brief introduction of fundamental issues on Nonrepudiation, including the types of Nonrepudiation service and cryptographic evidence, the roles of trusted third-party, Nonrepudiation phases and requirements, and the status of standardization. Then it describes the general multiparty Nonrepudiation problem, and analyzes state-of-the-art mechanisms. After this, it presents in more detail the 1-N multiparty Nonrepudiation solutions for distribution of different messages to multiple recipients. Finally, it discusses advanced solutions for two typical multiparty Nonrepudiation applications, namely, multiparty certified email and multiparty contract signing.
Mohamed G Gouda - One of the best experts on this subject based on the ideXlab platform.
-
NETYS - Nonrepudiation Protocols Without a Trusted Party
Networked Systems, 2016Co-Authors: Rezwana Reaz, Mohamed G GoudaAbstract:A Nonrepudiation protocol from party S to party R performs two tasks. First, the protocol enables party S to send to party R some text x along with sufficient evidence (that can convince a judge) that x was indeed sent by S. Second, the protocol enables party R to receive text x from S and to send to S sufficient evidence (that can convince a judge) that x was indeed received by R. Almost every published Nonrepudiation protocol from party S to party R involves three parties: the two original parties S and R, and a third party that is often called a trusted party. A well-known Nonrepudiation protocol that does not involve a third party is based on an assumption that party S knows an upper bound on the computing power of party R. This assumption does not seem reasonable especially since by violating this assumption, party R can manipulate the Nonrepudiation protocol so that R obtains all its needed evidence without supplying party S with all its needed evidence. In this paper, we show that Nonrepudiation protocols that do not involve a third party can be designed under reasonable assumptions. Moreover, we identify necessary and sufficient (reasonable) assumptions under which these protocols can be designed. Finally, we present the first ever \(\ell \)-Nonrepudiation protocol that involves \(\ell \) parties (none of which is trusted), where \(\ell \) \(\ge \) 2.
-
Nonrepudiation protocols in cloud systems
International Conference on Computing Communication and Networking Technologies, 2016Co-Authors: Mohamed G GoudaAbstract:A Nonrepudiation protocol from a sender S to a set of potential receivers {R1, R2, ..., Rn} performs two functions. First, this protocol enables S to send to every potential receiver Ri a copy of file F along with a proof that can convince an unbiased judge that F was indeed sent by S to Ri. Second, this protocol also enables each Ri to receive from S a copy of file F and to send back to S a proof that can convince an unbiased judge that F was indeed received by Ri from S. When a Nonrepudiation protocol from S to {R1, R2, ..., Rn} is implemented in a cloud system, the communications between S and the set of potential receivers {R1, R2, ..., Rn} are not carried out directly. Rather, these communications are carried out through a cloud C. In this paper, we present a Nonrepudiation protocol that is implemented in a cloud system and show that this protocol is correct. We also show that this protocol has two clear advantages over Nonrepudiation protocols that are not implemented in cloud systems.
-
ICCCNT - Nonrepudiation Protocols in Cloud Systems
Proceedings of the 7th International Conference on Computing Communication and Networking Technologies - ICCCNT '16, 2016Co-Authors: Mohamed G GoudaAbstract:A Nonrepudiation protocol from a sender S to a set of potential receivers {R1, R2, ..., Rn} performs two functions. First, this protocol enables S to send to every potential receiver Ri a copy of file F along with a proof that can convince an unbiased judge that F was indeed sent by S to Ri. Second, this protocol also enables each Ri to receive from S a copy of file F and to send back to S a proof that can convince an unbiased judge that F was indeed received by Ri from S. When a Nonrepudiation protocol from S to {R1, R2, ..., Rn} is implemented in a cloud system, the communications between S and the set of potential receivers {R1, R2, ..., Rn} are not carried out directly. Rather, these communications are carried out through a cloud C. In this paper, we present a Nonrepudiation protocol that is implemented in a cloud system and show that this protocol is correct. We also show that this protocol has two clear advantages over Nonrepudiation protocols that are not implemented in cloud systems.
-
two phase Nonrepudiation protocols
International Conference on Computing Communication and Networking Technologies, 2016Co-Authors: Rezwana Reaz, Mohamed G GoudaAbstract:A Nonrepudiation protocol from party S to party R performs two tasks. First, the protocol enables party S to send to party R some text x along with a proof (that can convince a judge) that x was indeed sent by S. Second, the protocol enables party R to receive text x from S and to send to S a proof (that can convince a judge) that x was indeed received by R. A Nonrepudiation protocol from one party to another is called two-phase iff the two parties execute the protocol as specified until one of the two parties receives its complete proof. Then and only then does this party refrain from sending any message specified by the protocol because these messages only help the other party complete its proof. In this paper, we present methods for specifying and verifying two-phase Nonrepudiation protocols.
-
ICCCNT - Two-phase Nonrepudiation Protocols
Proceedings of the 7th International Conference on Computing Communication and Networking Technologies - ICCCNT '16, 2016Co-Authors: Rezwana Reaz, Mohamed G GoudaAbstract:A Nonrepudiation protocol from party S to party R performs two tasks. First, the protocol enables party S to send to party R some text x along with a proof (that can convince a judge) that x was indeed sent by S. Second, the protocol enables party R to receive text x from S and to send to S a proof (that can convince a judge) that x was indeed received by R. A Nonrepudiation protocol from one party to another is called two-phase iff the two parties execute the protocol as specified until one of the two parties receives its complete proof. Then and only then does this party refrain from sending any message specified by the protocol because these messages only help the other party complete its proof. In this paper, we present methods for specifying and verifying two-phase Nonrepudiation protocols.
Robert Jueneman - One of the best experts on this subject based on the ideXlab platform.
-
securing wireless medicine confidentiality integrity Nonrepudiation malware prevention
2011 8th International Conference & Expo on Emerging Technologies for a Smarter World, 2011Co-Authors: Robert JuenemanAbstract:Wireless medicine is a growing part of the telehealth initiative, but the use of wireless medicine poses significant risks to both the patient/caregiver and the clinician or health care institution. Confidentiality, integrity, Nonrepudiation, and malware prevention are all vitally important considerations. The use of smart cards for both patient and clinician identification and authorization is encouraged, as well as the use of equivalent technology embedded within medical devices. A public policy solution to advance the availability of medical smart cards is urged, whereby Medicare/Medicaid, the Veterans Administration, and TRICARE would issue smart cards to their enrollees. The cost of such a deployment is conservatively estimated as less than $814 million, compared to the current cost of medical identity theft nationwide, estimated at $28 billion. Even if this technology were extended to the entire US population, the cost would only be about $3 billion, or a little more than a tenth of the current fraud costs, while providing a significant long-term benefit in terms of confidentiality, integrity, and Nonrepudiation.
-
Securing wireless medicine confidentiality, integrity, Nonrepudiation, & malware prevention
2011 8th International Conference & Expo on Emerging Technologies for a Smarter World, 2011Co-Authors: Robert JuenemanAbstract:Wireless medicine is a growing part of the telehealth initiative, but the use of wireless medicine poses significant risks to both the patient/caregiver and the clinician or health care institution. Confidentiality, integrity, Nonrepudiation, and malware prevention are all vitally important considerations. The use of smart cards for both patient and clinician identification and authorization is encouraged, as well as the use of equivalent technology embedded within medical devices. A public policy solution to advance the availability of medical smart cards is urged, whereby Medicare/Medicaid, the Veterans Administration, and TRICARE would issue smart cards to their enrollees. The cost of such a deployment is conservatively estimated as less than $814 million, compared to the current cost of medical identity theft nationwide, estimated at $28 billion. Even if this technology were extended to the entire US population, the cost would only be about $3 billion, or a little more than a tenth of the current fraud costs, while providing a significant long-term benefit in terms of confidentiality, integrity, and Nonrepudiation.
Jose A Onieva - One of the best experts on this subject based on the ideXlab platform.
-
multiparty Nonrepudiation a survey
ACM Computing Surveys, 2009Co-Authors: Jose A Onieva, Jianying Zhou, Javier LopezAbstract:Nonrepudiation is a security service that plays an important role in many Internet applications. Traditional two-party Nonrepudiation has been studied intensively in the literature. This survey focuses on multiparty scenarios and provides a comprehensive overview. It starts with a brief introduction of fundamental issues on Nonrepudiation, including the types of Nonrepudiation service and cryptographic evidence, the roles of trusted third-party, Nonrepudiation phases and requirements, and the status of standardization. Then it describes the general multiparty Nonrepudiation problem, and analyzes state-of-the-art mechanisms. After this, it presents in more detail the 1-N multiparty Nonrepudiation solutions for distribution of different messages to multiple recipients. Finally, it discusses advanced solutions for two typical multiparty Nonrepudiation applications, namely, multiparty certified email and multiparty contract signing.
