Anonymous authentication of membership in dynamic groups

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (leaves 34-36).by Todd C. Parnell.S.B.and M.Eng

Self Controllable Health Care Monitoring Arrangement for Patient

In this undertaking is utilized to the Condition care monitoring system. Distributed Healthcare cloud computing arrangement considerably facilitates effectual patient treatment for health consultation by allocating confidential condition data amid healthcare providers. Though, it brings concerning the trial of keeping both the data confidentiality and patients’ individuality privacy simultaneously. Countless continuing admission manipulation and nameless authentication schemes cannot be straightforwardly exploited. The arrangement acts there are provider, doctor, patient and admin. The provider is list to website to consent staying to appeal dispatch to admin. Admin is Proved to in a particular provider it deeds to the present add to doctors and hospital divisions established. User or Patient is list to the site. Patient Login to present the deed booking the doctor appointment in situation patient to dispatch a feedback to that doctor treatment comments onward to admin. Doctors is add provider to dispatch a username and password .Doctor is login to think patient appointment features and checking the doctor is present patient or fake user to identified to dispatch to symptoms description upload files(x-ray).Admin is finished procedure is upheld in this system. Patient dispatch doctors feedback bad or wrong to particular doctors appointment annulled temporally. In this undertaking generally utilized for patient and hospital ,doctors features through online upheld for India astute established on card

Aggregation and embedding for group membership verification

accepted at ICASSP 2019International audienceThis paper proposes a group membership verification protocol preventing the curious but honest server from reconstructing the enrolled signatures and inferring the identity of querying clients. The protocol quantizes the signatures into discrete embeddings, making reconstruction difficult. It also aggregates multiple embeddings into representative values, impeding identification. Theoretical and experimental results show the trade-off between the security and error rates

k Anonymous Private Query Based on Blind Signature and Oblivious Transfer

In this paper, we consider a scenario where there are a group of clients and a database server, and a client wishes to query the database, but does not want to reveal her or his query to the server. Current solutions for this problem are based on oblivious transfer, which usually requires high communication overhead. To reduce the communication overhead, we propose three k-anonymous private query protocols. Our first protocol is based on blind signature, where the server cannot determine the identity of the querying client from the group. Our second protocol is based on k-anonymous oblivious transfer, where the server cannot tell which record the querying client wants from k records. Our third protocol is a combination of the first and second protocols. Our protocols can achieve k-anonymity and are practical in many real-life applications

On the Use of Key Assignment Schemes in Authentication Protocols

Key Assignment Schemes (KASs) have been extensively studied in the context of cryptographically-enforced access control, where derived keys are used to decrypt protected resources. In this paper, we explore the use of KASs in entity authentication protocols, where we use derived keys to encrypt challenges. This novel use of KASs permits the efficient authentication of an entity in accordance with an authentication policy by associating entities with security labels representing specific services. Cryptographic keys are associated with each security label and demonstrating knowledge of an appropriate key is used as the basis for authentication. Thus, by controlling the distribution of such keys, restrictions may be efficiently placed upon the circumstances under which an entity may be authenticated and the services to which they may gain access. In this work, we explore how both standardized protocols and novel constructions may be developed to authenticate entities as members of a group associated to a particular security label, whilst protecting the long-term secrets in the system. We also see that such constructions may allow for authentication whilst preserving anonymity, and that by including a trusted third party we can achieve the authentication of individual identities and authentication based on timestamps without the need for synchronized clocks

Corporate values - a socio-functionalist approach exemplified along corporate sustainability values

This dissertation strives to create a systematic, comprehensive, theory-guided, analytic framework able to analyze corporate values beyond the false equation with human values. To accomplish this, the dissertation is based on two methodological blocks: The first block comprising chapter 2 to chapter 5 contributes the theoretical foundations and the theoretical reasoning supporting the creation of the analytical framework. This first block also undertakes a functional differentiation between corporate and individual values as well as outlines their different functional layers and phases. Based on these insights, the constitutive elements of the framework are identified, dis- cussed and correlated to form a functional framework. The second methodological block consists of chapter 6 and constitutes the practical validation of the theoretical approach developed in the preceding chapters. The framework’s ability to analyze corporate values and disclose value inconsistency is validated by applying it to the publicly declared corporate value of sustainability proclaimed by a real-life corporation. While all corporate values are validated using the framework, the framework is also utilized when some corporate values are replaced with new, reworked editions to validate the forming capabilities of the framework and demonstrate the explanatory power of well-designed corporate values. The dissertation’s findings should be considered on different levels. On a characterization level, the dissertation performs a literature-based, functional separation between corporate and individual values, while on an analytical level it places a detailed and theory-guided framework at one's disposal, facilitating the analysis and discussion of functional corporate values. Finally, the results of the framework’s application indicate that even though a corporation’s values can be award-winning, well intended, and successful, they can still base on misconceptions, inaccuracy, and gaps. Such corporate values have to rely on like-minded value recipients to close the communication gap according to the corporation’s ideology. Approaching the topic of corporate values with a framework specifically laid out to analyze and form corporate values turns out to result in a more accurate, conceivable, conveyable and there- fore more successful analysis of corporate values

Anonymous Authentication of Membership in Dynamic Groups

We present a protocol for authenticating an individual's membership in a group without revealing that individual's identity and without restricting how the membership of the group may be changed. Existing protocols that authenticate membership by identifying individuals do not provide anonymity. Those in which members share a common key require a new key to be distributed whenever an individual leaves the group. To overcome these limitations we introduce the verifiably common secret encoding to construct anonymous authentication protocols. These protocols both authenticate membership without identifying the member and enable a trusted third party to add and remove members of the group instantly, in a single message to the authenticator. Applications in electronic commerce and communication can now provide anonymous authentication while accommodating frequent changes in membership. Because a verifiably common secret encoding grows linearly with the size of the group, we describe techniq..