• Journal of Arbitration Studies
• /
• v.27 no.1
• /
• pp.37-57
• /
• 2017

An arbitrator in Pakistan is required to file an arbitral award in a civil court of competent jurisdiction for its recognition and enforcement if an arbitral award is domestic or before the concerned High Court if the arbitral award is international. The court of law is required to issue a decree upon submitted arbitral award if an interested party do not apply for modification or remission of an arbitral award and do not challenge it for setting it aside or for revocation of its recognition and enforcement within a prescribed time limit. The challenging process of an arbitral award can be started by the aggrieved party of an arbitration agreement at the seat of arbitration or at the place where recognition and enforcement of an arbitral award is sought. The aggrieved party to an arbitration agreement is required to challenge an arbitral award within a prescribed time limit if contracting parties have not excluded the right to challenge an arbitral award. Limitation for challenging an arbitral award in Pakistan is 30 days under article 158 of the Limitation Act 1908, starting from the date of service of notice of filling of an arbitral award before the court of law. Generally, 90 days are given for an appeal against decision of the civil court of law under section 96 of the Code of Civil Procedure 1908, it is therefore highly recommended that challenging time of an arbitral award should be increased from 30 to 90 days.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.437-454
• /
• 2020

According to the privacy regulations of the health insurance portability and accountability act (HIPAA), patients' control over electronic health data is one of the major concern issues. Currently, remote access authorization is considered as the best solution to guarantee the patients' control over their health data. In this paper, a new biometric-based key management scheme is proposed to facilitate remote access authorization anytime and anywhere. First, patients and doctors can use their biometric information to verify the authenticity of communication partners through real-time video communication technology. Second, a safety channel is provided in delivering their access authorization and secret data between patient and doctor. In the designed scheme, the user's public key is authenticated by the corresponding biometric information without the help of public key infrastructure (PKI). Therefore, our proposed scheme does not have the costs of certificate storage, certificate delivery, and certificate revocation. In addition, the implementation time of our proposed system can be significantly reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5653-5672
• /
• 2019

In cloud computing era, an increasing number of resource-constrained users outsource their data to cloud servers. Due to the untrustworthiness of cloud servers, it is important to ensure the integrity of outsourced data. However, most of existing solutions still have challenging issues needing to be addressed, such as the identity privacy protection of users, the traceability of users, the supporting of dynamic user operations, and the publicity of auditing. In order to tackle these issues simultaneously, in this paper, we propose a traceable dynamic public auditing scheme with identity privacy preserving for cloud storage. In the proposed scheme, a single user, including a group manager, is unable to know the signer's identity. Furthermore, our scheme realizes traceability based on a secret sharing mechanism and supports dynamic user operations. Based on the security and efficiency analysis, it is shown that our scheme is secure and efficient.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.43
• /
• pp.25-52
• /
• 2009

An acceptance is effected by a statement or other conduct of the offeree indicating assent. Silence or inactivity does not in itself amount to acceptance. An acceptance of an offer becomes effective at the moment the indication of assent reaches the offeror. It uses in stating rules on whether an acceptance is too late to form a contract and an offeree may withdraw an acceptance after transmission. The offeree may indicate assent by performing an act such as one relating to the dispatch of the goods or payment of the price without notice to the offeror. The acceptance by action also is to be performed within the time fixed between the parties or within a resonable time. However, an oral offer must be accepted immediately by an offeree. After an acceptance by action, the offeree avoid revocation of an offer by giving the offeror prompt notice to that effect. Even if a reply an offer contains additions, limitations or other modifications is a rejection of the offer and constitutes a counter offer, the reply to an offer contains additional and different terms which do not materially alter the terms of the offer constitutes an acceptance unless the offeror objects to the discrepancy or to that effect. Additional or different terms relating to the price, payment, quality & quantity of the goods, time & place of delivery, a party's liability or the settlement of disputes are considered to materially alter the terms of the offer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6169-6187
• /
• 2017

With the fast growth of mobile services, Mobile Cloud Computing(MCC) has gained a great deal of attention from researchers in the academic and industrial field. User authentication and privacy are significant issues in MCC environment. Recently, Tsai and Lo proposed a privacy-aware authentication scheme for distributed MCC services, which claimed to support mutual authentication and user anonymity. However, Irshad et.al. pointed out this scheme cannot achieve desired security goals and improved it. Unfortunately, this paper shall show that security features of Irshad et.al.'s scheme are achieved at the price of multiple time-consuming operations, such as three bilinear pairing operations, one map-to-point hash function operation, etc. Besides, it still suffers from two minor design flaws, including incapability of achieving three-factor security and no user revocation and re-registration. To address these issues, an enhanced and provably secure authentication scheme for distributed MCC services will be designed in this work. The proposed scheme can meet all desirable security requirements and is able to resist against various kinds of attacks. Moreover, compared with previously proposed schemes, the proposed scheme provides more security features while achieving lower computation and communication costs.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.342-352
• /
• 2006

Nowadays, Computing environment is changing to ubiquitous. In such ubiquitous computing environments, entities expect to access resources and services at any time from anywhere. Therefore, tile wily how to establish trust relationship among previously unknown devices or resources is needed under such environments. In this paper, we firstly review a model to delegate the trust to communicating entities in ubiquitous environment and its security problems(e.g., malicious right-delegation and revocation of right-delegation). Then, we design a new model for secure delegation over communication entities which is based on two-party signature scheme, and implement it.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1257-1260
• /
• 2005

인증서 상태 확인은 해당 거래에 사용되는 인증서에 대해 유효한 인증서임을 판별하기 위한 과정으로 인증서 표준이 제정된 이후로 계속적으로 연구되고 있는 분야이다. 현재 가장 보편적으로 이용되는 인증서 상태 확인 기법은 인증서폐지목록(CRL : Certificate Revocation List)을 이용하는 기법이다. 이 기법은 방법 자체가 가지고 있는 시간격차 문제와 물리적 파일 처리의 과부하로 인하여 사용에 많은 제약이 따른다. 이를 해결하기 위해 온라인 인증서 상태 프로토콜(OCSP : OnLine Certificate Status Protocol) 기법이 제시되었다. 이 기법은 CRL 기법의 비 실시간성 문제를 해결한다. 하지만 서비스 요청 서버의 과부하 문제와 구조적 집중화 문제로 인하여 인증서 상태를 확인 하는데 소요되는 시간이 다소 오래 걸린다는 문제가 있다. 본 논문에서는 검증 요청자의 신원정보에 대한 해쉬값을 이용하여 인증서 상태 확인 요청을 하고 이를 통해 인증서 상태 확인 과정을 진행함으로써 통신 부하를 감소시키고 실시간으로 인증서 상태를 확인 할 수 있는 검증 요청자 신원 정보를 이용한 인증서 상태 확인 메커니즘을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.472-481
• /
• 2006

J. Zhou et al. proposed a new public-key framewort in which the maximum lifetime of a certificate is divided into short periods and the certificate could be expired at the end of any period under the control of the certificate owner(or his manager in a corporate environment). However, J. Zhou et al.'s public-key framework is not suitable on implementation in real world. Therefore, we review some security Parameters to change them into more suitable ones for implementation and remove an unnecessary trust party of J. Zhou et al.'s public-key framework. Then, we propose an improved scheme for realistic solution. Moreover, we present a practical application based on the improved framework.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6121-6144
• /
• 2019

Numerous privacy-preserving authentication schemes have been proposed but vehicular ad hoc networks (VANETs) still suffer from security and privacy issues as well as computation and communication overheads. In this paper, we proposed a robust conditional privacy-preserving authentication scheme based on pseudonym root with cuckoo filter to meet security and privacy requirements and reduce computation and communication overheads. In our proposed scheme, we used a new idea to generate pseudonyms for vehicles where each on-board unit (OBU) saves one pseudonym, named as "pseudonym root," and generates all pseudonyms from the same pseudonym. Therefore, OBU does not need to enlarge its storage. In addition, the scheme does not use bilinear pairing operation that causes computation overhead and has no certification revocation list that leads to computation and communication overheads. The proposed scheme has lightweight mutual authentication among all parties and just for once. Moreover, it provides strong anonymity to preserve privacy and resists ordinary attacks. We analyzed our proposed scheme and showed that it meets security and privacy requirements of VANETs and is more efficient than traditional schemes. The communication and computation overheads were also discussed to show the cost-effectiveness of the proposed scheme.