Delayed password disclosure

IOSR Journal of Computer Engineering, 2014

In recent years, distributed computing systems has been widely explored in order to improve system performance in terms of scalability and reliability.A distributed computing system allows the user to share, select, and aggregate the distributed heterogeneous computational and storage resources, which are under the control of different sites or networks. A distributed system also provides solutions to the complex scientific or engineering problems, such as weather forecasting, medical diagnoses, and stock portfolio management. However, the distributed nature of the system also raises some serious challenges. This paper covers the major challenges of security& design.However, complete distributed nature of the system raises serious challenges in domains of security like Scheduling,Objective Function,Security and Trust and also in domain of design like Heterogeneity,Openness,Reliability and Fault Tolerance, etcIn this paper, we aim to identify the challenges of distributed systems.

We describe a theory of authentication and a system that implements it. Our theory is based on the notion of principal and a 'speaks for' relation between principals. A simple principal either has a name or is a communication channel; a compound principal can express an adopted role or delegated authority. The theory shows how to reason about a principal's authority by deducing the other principals that it can speak for; authenticating a channel is one important application. We use the theory to explain many existing and proposed security mechanisms. In particular, we describe the system we have built. It passes principals efficiently as arguments or results of remote procedure calls, and it handles public and shared key encryption, name lookup in a large name space, groups of principals, program loading, delegation, access control, and revocation.

Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007), 2007

The early 1980s saw the development of some rather sophisticated distributed systems. These were not merely networked file systems: rather, using remote procedure calls, hierarchical naming, and what would now be called middleware, they allowed a collection of systems to operate as a coherent whole. One such system in particular was developed at Newcastle that allowed pre-existing applications and (Unix) systems to be used, completely unchanged, as components of an apparently standard large (multiprocessor) Unix system. The Distributed Secure System (DSS) described in our 1983 paper proposed a new way to construct secure systems by exploiting the design freedom created by this form of distributed computing. The DSS separated the security concerns of policy enforcement from those due to resource sharing and used a variety of mechanisms (dedicated components, cryptography, periods processing, separation kernels) to manage resource sharing in ways that were simpler than before. In this retrospective, we provide the full original text of our DSS paper, prefaced by an introductory discussion of the DSS in the context of its time, and followed by an account of the subsequent implementation and deployment of an industrial prototype of DSS, and a description of its modern interpretation in the form of the MILS architecture. We conclude by outlining current opportunities and challenges presented by this approach to security.

Several manufacturers have recently started to equip their hardware with security modules. These typically consist of smart cards or special microprocessors. Examples include the "Embedded Security Subsystem" within the recent IBM Thinkpad or the IBM 4758 secure co-processor board . In fact, a large body of computer and device manufacturers has founded the Trusted Computing Group (TCG) [9] to promote this idea.

2004

We will refer to a message that is readable, or not encrypted, as plaintext, cleartext and denote it with the symbol M. The process of disguising a message to hide its substance is called encryption. We will represent this operation as E(M). The encrypted message, C=E(M) is called ciphertext. The process of turning ciphertext back into plaintext, M=D(C), is called decryption. Cryptography is the art and science of keeping messages secure. In addition to providing confidentiality, cryptography is also used for:

Tehnicki vjesnik - Technical Gazette

Original scientific paper Most user authentication methods rely on a single verifier being stored at a central location within the information system. Such information storage presents a single point of compromise from a security perspective. If this system is compromised it poses a direct threat to users' digital identities if the verifier can be extracted from the system. This paper proposes a distributed authentication environment in which there is no such single point of compromise. We propose an architecture that does not rely on a single verifier to authenticate users, but rather a distributed authentication architecture where several authentication servers are used to authenticate a user. We consider an authentication environment in which the user authentication process is distributed among independent servers. Each server independently performs its own authentication of the user, for example by asking the user to complete a challenge in order to prove his claim to a digital identity. The proposed architecture allows each server to use any authentication factor. We provide a security analysis of the proposed architecture and protocol, which shows they are secure against the attacks chosen in the analysis.

– Ever since the emergence of computers, technology and the Internet, security has been a major limitation faced in various paradigms. Hadoop, which was created by Doug Cutting for Google is now widely used in different platforms like Facebook, Yahoo!, and other applications, which require a high level of information security. Authentication, being one of the major goals of information security, would be implemented in this project using Security Assertion Markup Language (SAML) tokens. SAML increases security by eliminating additional credentials that will terminate opportunities for identity theft, and guarantee authentication (verifying identity). This survey will discuss an extensive review of the current state-of-the-art and the use cases of SAML tokens for authentication and other applications in which it is useful, its challenges, as well as its proven efficiency in past and recent works.

1992

Remote commercial applications like databases, telebanking, electronic mail systems run security mechanisms based on passwords. Too many passwords per user become a security problem. The goal of this research is to design systems allowing "password-less" user access to network services while improving the security of existing password mechanisms.

2006

Distributed Computing Theory continues to be one of the most active research fields in Theoretical Computer Science today. Besides its foundational topics (such as consensus and synchronization), it is currently being enriched with many new topics inspired from modern technological advances (e.g., the Internet). In this note, we present eight open problems in Distributed Computing Theory that span a wide range of topics – both classical and modern. 1 Wait-Free Consensus A consensus protocol is a distributed algorithm where n processes collectively arrive at a common decision value starting from individual process inputs. It must satisfyagreement(all processes decide on the same value), validity (the decision value is an input to some process), and termination(all processes eventually decide). A protocol in an asynchronous shared-memory system is wait-freeif each process terminates in a finite number of its own steps regardless of scheduling. From the FLP impossibility result [31, 54...