Master Private Research Articles

WORK LIFE BALANCE IN ROAD TRANSPORT CORPORATION With reference to TSRTC Hanamkonda

Individuals are typically artisans or homegrown. Any character usually spends the majority of his useful time during the day on pleasant artwork, and this is an important aspect of his reality. His effectiveness is dependent on factors that are currently not the most truthful about his personal life. The artwork-life strength carries the responsibility of achieving a balance between professional-best artwork and remarkable video games, reducing erosion between legitimate and homegrown or private lifestyles. The balance between extreme and enjoyable sports improves quickly, and as a result, labor efficiency rises. It improves pleasure in every master's private existence. This will discusses specific aspects of balancing work and life. Having burn-out and stressed employees are of no use to the organization and the key to make an organization successful lies in the satisfaction, commitment and deliberate involvement of the employees. For this purpose many companies have begun to introduce work-life balance programs in order to help the employees efficiently deal with their work professional and personal lives Keywords: Work Life Balance, Organization

Improving User Privacy in Identity-Based Encryption Environments

The promise of identity-based systems is that they maintain the functionality of public key cryptography while eliminating the need for public key certificates. The first efficient identity-based encryption (IBE) scheme was proposed by Boneh and Franklin in 2001; variations have been proposed by many researchers since then. However, a common drawback is the requirement for a private key generator (PKG) that uses its own master private key to compute private keys for end users. Thus, the PKG can potentially decrypt all ciphertext in the environment (regardless of who the intended recipient is), which can have undesirable privacy implications. This has led to limited adoption and deployment of IBE technology. There have been numerous proposals to address this situation (which are often characterized as methods to reduce trust in the PKG). These typically involve threshold mechanisms or separation-of-duty architectures, but unfortunately often rely on non-collusion assumptions that cannot be guaranteed in real-world settings. This paper proposes a separation architecture that instantiates several intermediate CAs (ICAs), rather than one (as in previous work). We employ digital credentials (containing a specially-designed attribute based on bilinear maps) as the blind tokens issued by the ICAs, which allows a user to easily obtain multiple layers of pseudonymization prior to interacting with the PKG. As a result, our proposed architecture does not rely on unrealistic non-collusion assumptions and allows a user to reduce the probability of a privacy breach to an arbitrarily small value.

CPPA-D: Efficient Conditional Privacy-Preserving Authentication Scheme With Double-Insurance in VANETs

With the establishment of the intelligent transportation system (ITS), the vehicular ad hoc networks (VANETs) play a significant role for improving traffic safety and efficiency. In order to avoid malicious attack and resource abuse in VANETs, the use of digital signature scheme is widely regarded as the first line of defense to achieve a secure VANETs system. However, it is still a challenging task to design a conditional privacy preserving authentication scheme, to resolve security and privacy-preserving problems in VANETs and to improve the utilization ratio of information resources. In addition, the relevant researches show that the tamper-proof device (TPD) is vulnerable to side channel attacks. If the sensitive parameters stored in TPD are extracted, the system would be totally broken. To address these issues, this paper introduces a conditional privacy-preserving authentication scheme with double-insurance supporting batch verification (CPPA-D) for VANETs, which is constructed in cyclic groups on elliptic curves. Either the master private key or the vehicle private key is leaked, it is impossible to forge a valid authenticated message to deceive the recipients, which achieves double-insurance for private keys. When multiple messages are received, our CPPA-D scheme allows the receiver to perform batch verification to improve the efficiency. Security analysis shows that our CPPA-D scheme not only can resist traditional attacks but also can solve the security problems caused by private key stolen in the TPD under side channel attack. There is also a certain advantage in computation overhead according to efficiency analysis and comparison.

PENGARUH KOMPETENSI TUTOR, HARGA DAN PRESTASI BELAJAR SISWA TERHADAP LOYALITAS PELANGGAN LEMBAGA BIMBINGAN BELAJAR DENGAN KEPUASAN SEBAGAI VARIABEL INTERVENING

Education is an important factor in the development and progress of a nation. The development of the current education sector is marked by the many businesses that are engaged in the field of educational support services (Private Tutoring Institutions). This study aims to find out how the influence of tutor competency, course price level and learning achievement on customer loyalty through satisfaction in the Private Tutoring Institution “Master Privat”. The object of the study was the students and parents of Master Private’ students as many as 100 respondents. The method of collecting data is by distributing questionnaires. Then the data is analyzed using Path Analysis techniques with software Lisrel version 8.80 and SPSS version 22. The results showed that tutors' competency, price and learning achievement, each had a partial and significant direct effect on satisfaction. Tutor competency, price and learning achievement have a simultaneous effect on satisfaction. And the final result is the competence of the tutor, price and learning achievement influence on customer loyalty through satisfaction as an intervening variable

A secure lattice-based anonymous authentication scheme for VANETs

ABSTRACTIntelligent transportation systems (ITS) can improve the efficiency and safety of transportation. Vehicular Ad Hoc Networks (VANETs) are an important foundation of ITS. However, before being deployed on a large scale, VANETs should resolve the security and privacy issues generated from wireless communication. Digital signature has been used in VANETs to construct anonymous authentication schemes which can realize authentication and privacy preservation. Many previous anonymous authentication schemes have preloaded the master private key into a tamper-proof devices (TPD) which generate the pseudo identity and signature for each vehicle. However, tamper-proof devices cannot defend against side channel attacks. In order to realize better security, this paper takes advantage of lattice-based cryptography to design an anonymous authentication scheme without tamper-proof devices, which achieves security and privacy desired by VANETs. Furthermore, the anonymous authentication scheme lattice based also can defend against quantum computer attack. Finally, the security of this lattice-based anonymous authentication scheme is proven.

An Anti-Quantum Transaction Authentication Approach in Blockchain

Blockchain is a new distributed and decentralized technology, and gradually attracts worldwide attention, but it is vulnerable to quantum attacks that would solve elliptic curve digital logarithm problem, which is mainly used for transaction authentication in blockchain. The key needed for authentication comes from the wallet. To ensure that the size of the wallet is fixed and easy to manage, deterministic wallets are required to be used. But if existing anti-quantum signature schemes, such as lattice-based signature are used directly in blockchain to solve the problem, it would have made the wallet bloat. In this paper, we present a novel anti-quantum transaction authentication scheme in the blockchain. In order to construct lightweight nondeterministic wallets, the key point is that public and private keys are generated from a set of master public and private key(Seed Key). We leverage on Bonsai Trees technology and propose a new authentication method which can extend a lattice space to multiple lattice spaces accompanied by the corresponding key. Every signature of a transaction uses a lattice space so as to ensure the randomness and the security of the master private key. And we give the complete security proof and analysis. This paper provides the theoretical support for the application of blockchain in the post quantum age.

A novel key refreshment scheme increasing the security of conditional access systems in digital satellite pay-TV

This paper proposes a new scheme that faces one of the basic deficiencies of Conditional Access Systems (CASs) employed in satellite Pay-TV systems, Master Private Key's (MPK) infinite crypto period. The novelty of the proposed scheme is that it offers the ability to the administrator of the CAS to refresh users' MPKs at desired times. Thereby, the security of the CAS is significantly increased. The refreshment of the MPKs is accomplished through Lagrange Interpolation Method (LIM). In addition, the bandwidth consumption of several contemporary CASs of the Pay-TV market is presented. Based on those measurements, the bandwidth overhead that the new scheme imposes is proven to be negligible. The efficiency of the LIM for the refreshment of the MPK is verified through its implementation on a 65 nm Field Programmable Gate Array (FPGA). Finally, the required user's MPK refreshment time was achieved to be less than 0.15 ms.

Strongly secure identity-based authenticated key agreement protocols in the escrow mode

Escrowable identity-based authenticated key agreement (AKA) protocols are desirable under certain circumstances especially in certain closed groups applications. In this paper, we focus on two-party identitybased AKA schemes in the escrow mode, and present a strongly secure escrowable identity-based AKA protocol which captures all basic desirable security properties including perfect forward secrecy, ephemeral secrets reveal resistance and so on. The protocol is provably secure in the extended Canetti-Krawczyk model, and its security can be reduced to the standard computational bilinear Diffie-Hellman assumption in the random oracle model. Assuming no adversary can obtain the master private key for the escrow mode, our scheme is secure as long as each party has at least one uncompromised secret. Also, we present two strongly secure variants of the protocol, which are computationally more efficient than the original scheme.

Escrowable identity-based authenticated key agreement protocol with strong security

Escrowable identity-based authenticated key agreement protocols are welcome in certain closed groups applications, where audit trail is a legal requirement. In this paper, we present a strongly secure one-round escrowable identity-based two-party authenticated key agreement protocol, which captures all basic desirable security properties including perfect forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extended Canetti–Krawczyk (eCK) model. We show that the security of the protocol can be reduced to the standard computational bilinear Diffie–Hellman assumption in the random oracle model. Assuming that no adversary can obtain the master private key for the escrow mode, our scheme is secure as long as each party has at least one uncompromised secret. To the best of our knowledge, our scheme is the first escrowable identity-based authenticated key agreement protocol provably secure in the eCK model.

Security Vulnerability of ID-Based Key Sharing Schemes

Recently, several ID-based key sharing schemes have been proposed, where an initiation phase generates users' secret key associated with identities under the hardness of integer factorization. In this letter, we show that, unfortunately any key sharing scheme with this initiation phase is intrinsically insecure in the sense that the collusion of some users enables them to derive master private keys and hence, generating any user's secret key.