Relevant bibliographies by topics / Shared secrets

Academic literature on the topic 'Shared secrets'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Shared secrets.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Shared secrets"

1

ZHANG, EN, and YONGQUAN CAI. "RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS." International Journal of Foundations of Computer Science 24, no. 06 (September 2013): 879–97. http://dx.doi.org/10.1142/s012905411350024x.

Full text
Abstract:
Rational secret sharing was first introduced by Halpern and Teague (STOC, 2004). Since then, a series of works have focused on designing rational secret sharing protocols. However, most existing solutions can share only one secret at one secret sharing process. To share multiple secrets such as m secrets, the dealer must redistribute shares for m times. In addition, previous works assume existence of broadcast channel which is not realistic. Motivated by those problems, this paper proposes a rational multi-secret sharing scheme, which combines the secret sharing scheme with game theory. In the protocol, the problem of sharing multiple secrets is addressed, and there are multiple secrets to be shared during one secret sharing process. Furthermore, this work starts off by constructing a protocol in simultaneous broadcast networks, and then we emulate the broadcast channel over point-to-point networks. Based on a computational assumption, we show that rational players have no incentive to deviate from the protocol and every player can obtain multi-secret fairly.
APA, Harvard, Vancouver, ISO, and other styles
2

Xu, Guoai, Jiangtao Yuan, Guosheng Xu, and Zhongkai Dang. "An Efficient Compartmented Secret Sharing Scheme Based on Linear Homogeneous Recurrence Relations." Security and Communication Networks 2021 (July 20, 2021): 1–8. http://dx.doi.org/10.1155/2021/5566179.

Full text
Abstract:
Multipartite secret sharing schemes are those that have multipartite access structures. The set of the participants in those schemes is divided into several parts, and all the participants in the same part play the equivalent role. One type of such access structure is the compartmented access structure, and the other is the hierarchical access structure. We propose an efficient compartmented multisecret sharing scheme based on the linear homogeneous recurrence (LHR) relations. In the construction phase, the shared secrets are hidden in some terms of the linear homogeneous recurrence sequence. In the recovery phase, the shared secrets are obtained by solving those terms in which the shared secrets are hidden. When the global threshold is t , our scheme can reduce the computational complexity of the compartmented secret sharing schemes from the exponential time to polynomial time. The security of the proposed scheme is based on Shamir’s threshold scheme, i.e., our scheme is perfect and ideal. Moreover, it is efficient to share the multisecret and to change the shared secrets in the proposed scheme.
APA, Harvard, Vancouver, ISO, and other styles
3

Luca, Daniela. "Secret of Life, Secret of Death." Romanian Journal of Psychoanalysis 13, no. 2 (December 1, 2020): 73–90. http://dx.doi.org/10.2478/rjp-2020-0017.

Full text
Abstract:
Abstract From his first Freudian studies, but especially in S. Freud’s correspondence with W. Fliess, the term “secret” (geheim, geheimnis) appears frequently, hence its weight and significance in psychic life, and implicitly as a form of intimacy and of confidentiality shared in the analytical relationship. The need and ability to keep a secret, but also the ability to confess, to share a secret, are mainly related to a certain elaboration of the sexual register, pre-oedipal and oedipal, of the elaboration of the traumatic, of the affects of shame, humiliation, guilt, as well as their impact on the psychic life of the subject, how they marked the subject’s existence and relationships. Another essential dimension is the inter- and transgenerational transmission of family “secrets” – often violent, incestuous experiences, such as severe diseases, genetic abnormalities, murders, suicides – transmitted over two, three or more generations, unconsciously. This work aims to reveal the secret’s dimension of life in clinical practice, as well as the deadly dimension of secrets and their vicissitudes in transfer-counter transference.
APA, Harvard, Vancouver, ISO, and other styles
4

Seitz, Frederick. "How allies shared radar secrets." Nature 384, no. 6608 (December 1996): 424–25. http://dx.doi.org/10.1038/384424a0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Jingbang, Xiyu Chen, Luyuan Zhang, Shufen Zhou, and Daoshun Wang. "A Multi-Secret Reputation Adjustment Method in the Secret Sharing for Internet of Vehicles." Security and Communication Networks 2022 (May 13, 2022): 1–13. http://dx.doi.org/10.1155/2022/1413976.

Full text
Abstract:
Secure data sharing for the Internet of Vehicles (IoV) has drawn much attention in developing smart cities and smart transportation. One way to achieve that is based on the reputation of the participant vehicles and the interaction between them. Most of the reputation adjustment schemes are aimed at single-secret situations, and there are cases where shared information leaks after reconstruction; and the shared information of all participants need to be updated again. This paper uses binary asymmetric polynomials to realize the asynchronous reconstruction of secrets, that is, multiple secrets are distributed at once, and each secret is independent of each other when it is restored. Each participant holds the shared divided information part of a one-variable polynomial. When the secret is reconstructed, the shared information part is not directly shown to ensure that the shared information is not leaked. Furthermore, we provide another way to keep the secret unchanged and modify the secret threshold.
APA, Harvard, Vancouver, ISO, and other styles
6

Errahmani, Hichem Bouchakour, and Hind Ikni. "A New Approach to Verifying and Sharing a Secret QR Code using Elliptic Curves." Malaysian Journal of Computing and Applied Mathematics 3, no. 1 (June 30, 2020): 55–65. http://dx.doi.org/10.37231/myjcam.2020.3.1.44.

Full text
Abstract:
One of the modern applications of cryptography is the sharing of secrets in occurrence keys. Indeed, the need to establish a shared secret key in a multi-user system clearly remains a major problem of trust between users. Therefore, one solution is to share this secret key between users seamlessly. New technologies embedded systems such as sensor networks provide an ideal platform for sharing secrets. In addition, elliptic curves offer an adequate solution for reducing the size of keys, which is suitable for embedded systems. In this article, we propose an approach for sharing a secret leaked in a QR code adapted for a multiuser system, where each user has the ability to verify its share by an access structure. The system allows a recovery without loss of data in this case the QR code used.
APA, Harvard, Vancouver, ISO, and other styles
7

Badra, M., and I. Hajjeh. "Key-Exchange Authentication Using Shared Secrets." Computer 39, no. 3 (March 2006): 58–66. http://dx.doi.org/10.1109/mc.2006.94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bai, Hai-Yan, Zhi-Hui Li, and Na Hao. "Quantum Security Computation on Shared Secrets." International Journal of Theoretical Physics 58, no. 1 (October 15, 2018): 10–21. http://dx.doi.org/10.1007/s10773-018-3905-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Frijns, Tom, Catrin Finkenauer, and Loes Keijsers. "Shared secrets versus secrets kept private are linked to better adolescent adjustment." Journal of Adolescence 36, no. 1 (February 2013): 55–64. http://dx.doi.org/10.1016/j.adolescence.2012.09.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

JENSEN, JOAN M. "Telling Stories: Keeping Secrets." Agricultural History 83, no. 4 (October 1, 2009): 437–45. http://dx.doi.org/10.1215/00021482-83.4.437.

Full text
Abstract:
Abstract This article addresses the reticence of some farm women to share their experiences with historians and how that desire to keep secrets collides with the desire by scholars to tell the stories of these women. It argues that scholars must continue to struggle with the issue of which stories to tell publicly and which to keep private. The author discusses her own experience telling stories about rural women in the 1970s and the need to give voice to the heritage of rural women, especially of groups that have feared revealing their experiences. She offers examples of historians of rural women who have successfully worked with formerly silenced populations and urges historians to continue to tell stories about these lives, to reevaluate what has been already learned, to ask new questions, and to discuss which secrets need to be shared.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Shared secrets"

1

Stadler, Jonathan James. "Shared secrets – concealed sufferings : social responses to the AIDS epidemic in Bushbuckridge, South Africa." Thesis, University of Pretoria, 2012. http://hdl.handle.net/2263/23025.

Full text
Abstract:
From the early 1990s, rates of HIV infection increased dramatically in South Africa and by the early 2000s, AIDS emerged as the main cause of death for adult South Africans. During the first half of the 2000s, the South African government’s response to this crisis was inadequate, marked by denial and delays in implementing prevention and treatment, resulting in thousands of preventable deaths. Yet, apart from the challenges posed by the predominantly urban-based Treatment Action Campaign (TAC), the absence of a social response to this crisis is notable, especially in rural settings. This scenario forms the broad backdrop to this ethnographic study that draws on participant observation and interviews undertaken over a three-year period (2002-2005) in KwaBomba village previously in the Gazankulu Homeland, now located in the Bushbuckridge municipality of the South African lowveld. An ethnographic perspective provides an intimate vantage point from which to view peoples’ experiences of the AIDS epidemic and their responses in context. This perspective draws attention to gaps in public health and biomedical understandings of the epidemic and suggests alternatives to these understandings. In Bushbuckridge, mortality and morbidity due to AIDS became visible in the late 1990s and early 2000s. Households were incapable of dealing with the burden of illness and death while the health services were often unwilling and ill-prepared. HIV prevention campaigns based on individual behaviour change were not well suited to a context in which HIV spread through sexual networks. Despite widespread awareness of the threat of AIDS, the disease was subjected to public censorship and AIDS suffering was concealed. Public discourses of AIDS were hidden within gossip and rumour and articulated as witchcraft suspicions and accusations. Although these discourses appear to deny and suppress the reality of AIDS, I suggest that they are active attempts to deal with the AIDS crisis: gossip and rumour allocate blame and construct a local epidemiology through which the epidemic can be surveilled; interpreting AIDS as witchcraft creates the possibility of avenging untimely death. These discursive forms are critical in informing individual and social responses to the AIDS epidemic. While the absence of public acknowledgement of AIDS as a cause of illness and death suggests denial and fatalism and appears to limit public action, subaltern discourses create shared secrets to manage the AIDS epidemic at the local level. Furthermore, these discourses may constitute a form of resistance against biomedical models of causality. Ethnographic enquiry at the local level offers a nuanced understanding of social responses to the AIDS epidemic. By examining forms of expression that lie outside the domain of public health, the thesis reveals how these constitute significant forms of social action in response to the epidemic.
Thesis (PhD)--University of Pretoria, 2012.
Anthropology and Archaeology
unrestricted
APA, Harvard, Vancouver, ISO, and other styles
2

Tomescu, Nicolescu Ioan Alin. "How to keep a secret and share a public key (using polynomial commitments)." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/128298.

Full text
Abstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2020
Cataloged from PDF of thesis.
Includes bibliographical references (pages 155-171).
Despite 40+ years of amazing progress, cryptography is constantly plagued by two simple problems: keeping secret keys secret and making public keys public. For example, public-key encryption is secure only if each user (1) keeps his secret key out of the hands of the adversary and (2) correctly distributes his public key to all other users. This thesis seeks to address these two fundamental problems. First, we introduce communication-efficient, fully-untrusted append-only logs, which can be used to correctly distribute public keys. Our constructions have logarithmic-sized proofs for the two key operations in append-only logs: looking up public keys and verifying the log remained append-only. In contrast, previous logs either have linear-sized proofs or need extra trust assumptions. Our logs can also be used to secure software distribution and, we hope, to increase transparency in any institution that wants to do so. Second, we speed up threshold cryptosystems, which protect secret keys by splitting them up across many users. We introduce threshold signatures, verifiable secret sharing and distributed key generation protocols that can scale to millions of users. Our protocols drastically reduce execution time, anywhere from 2x to 4500x, depending on the scale. For example, at large scales, we reduce time from tens of hours to tens of seconds. At the core of most of our contributions lie new techniques for computing evaluation proofs in constant-sized polynomial commitments. Specifically, we show how to decrease the time to compute n proofs for a degree-bound n polynomial from O(n²) to O(n log n), at the cost of increasing proof size from O(1) to O(log n). Our techniques could be of independent interest, as they give rise to other cryptographic schemes, such as Vector Commitments (VCs).
by Ioan Alin Tomescu Nicolescu.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
3

Brasselet, Renato. "La circulation de la donnée à caractère personnel relative à la santé : disponibilité de l’information et protection des droits de la personne." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0333/document.

Full text
Abstract:
La e santé, la m-santé et la quantification de soi connectent le corps et bousculent le modèle traditionnel du soin. Ils le font glisser d’une médecine curative et monopolistique à une médecine préventive et adoptant une approche de la santé telle que définie par l’OMS. Par ce truchement, la personne n’est plus simplement placée au centre du dispositif de soin elle en devient l’un des acteurs y compris dans l’intimité de sa vie privée. Par ailleurs, sans cesse à la recherche de la réalisation d’économie mais aussi de qualité, le système de santé, a muté, sous l’effet du déploiement de l’e-santé. Il en résulte qu’il est désormais substantiellement décloisonné et ne peut plus être synthétisé dans la dichotomie classique entre le sanitaire et le médico-social. Le vecteur et la résultante de ce phénomène consiste dans la circulation de l’information de santé. Désormais majoritairement numérisée elle est devenue indispensable au soin ainsi qu’au fonctionnement du système de santé. Le soin est désormais conçu autour de l’échange et du partage catégoriel et inter-catégoriel, voire même homme-machine ou machine-machine et non plus sur une médecine fondée sur le secret. L’Homme devenu homo numericus n’en est pas pour autant dépourvu de tout droits et de toute intimité. Le droit et la techno-droit s’inscrivent dans ce jeu savant dont la moindre réforme inconséquente pourrait en bouleverser l’équilibre précaire
Health, m-health and self quantification connect the body and disrupt the traditional model of care. They are moving it from curative and monopoly medicine to preventive medicine and taking a WHO-defined approach to health. By this means, the person is no longer simply placed at the center of the care device he becomes one of the actors including in the intimacy of his privacy.On the other hand, in search of the realization of economy but also of quality, the health system, has mutated, under the effect of the deployment of e-health. As a result, it is now substantially landscaped and can no longer be synthesized into the classic dichotomy between health and social medicine. The vector and resultant of this phenomenon consists in the circulation of health information. From now on, it has become largely digital and essential for the care and functioning of the healthcare system. The care is now conceived around categorical and inter-categorical exchange and sharing, even man-machine or machine-machine and no longer on a medicine based on secrecy. The Man who has become a homo Numericus is not without all rights and privacy. Law and techno-law are part of this scholarly game, the slightest inconsistent reform of which could upset its precarious balance
APA, Harvard, Vancouver, ISO, and other styles
4

Bharath, Tati. "A framework to implement delegation in offline PACS : A strategy to restrict user’s path." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-127851.

Full text
Abstract:
Physical access control systems (PACS) deal with the security of the availability of resources. They work as an alternative to traditional manual security access control. Access control has two variants, the logical which deals with computer environments and the physical which deals with the physical entry into a property or warehouses. However, offline physical access control systems cannot enforce the user’s path making it unsuitable for use in classified areas, such as places where the public is restricted. Therefore, offline PACS need a framework that can delegate the authority to enforce the user’s path. This is satisfactorily met in the presented research with a new design of offline PACS that has the capability to implement delegation. This framework allows the locks to dynamically write and read access policies onto and from a smart card. It works by means of a construct called “Path Array” and communication among different entities occurs via a chain of trust formed with the use of pre-shared keys.
APA, Harvard, Vancouver, ISO, and other styles
5

Lichtenberg, Alex Leon. "A Historical Review of Five of the Top Fast Food Restaurant Chains to Determine the Secrets of Their Success." Scholarship @ Claremont, 2012. http://scholarship.claremont.edu/cmc_theses/361.

Full text
Abstract:
The primary goal of this paper is to critically examine five of the top nine US fast food chains to look at their history and to determine what factors have lead to their massive success. The companies that will be analyzed include: McDonald's, Taco Bell, Kentucky Fried Chicken, Domino's Pizza, and Subway. Similarities and differences of these companies are compared and contrasted throughout the paper and clearly demonstrate how each company has managed to capture and maintain major market share in their respective food categories. Areas that are examined range from product quality to to business models to consumer psychology. A review of these companies reveals that there are specific success factors for each, and one overarching factor for all. Specific factors include, but are not limited to marketing technique, organizational structure and overall business concept. The one factor that seems critical to all is entering the market with an innovative and unique concept.
APA, Harvard, Vancouver, ISO, and other styles
6

Léonard-Roques, Véronique. "Réécritures du mythe de Caïn au XXe siècle : Le compagnon secret (Joseph Conrad), Abel Sanchez (Miguel de Unamuno), Demian (Hermann Hesse), A l'Est d'Eden (John Steinbeck), L'emploi du temps (Michel Butor), Le roi des Aulnes (Michel Tournier)." Clermont-Ferrand 2, 1999. http://www.theses.fr/1999CLF20013.

Full text
Abstract:
La spécificité et l'originalité des réécritures du mythe de Caïn dans les romans étudiés seront mieux saisies à l'issue d'un panorama diachronique qui, partant du récit biblique (Genèse IV), s'arrêtera sur ses principales lectures exégétiques, puis sur les grandes articulations de son histoire littéraire. Le Caïn du 20e est inséparable de la crise du sujet et des valeurs, des fractures historiques à l'oeuvre dans la modernité. La bipartition traditionnelle qui opposait Caïn et Abel selon un système axiologique radical, mais susceptible de se retourner, est frappée d'hybridité, vouée à l'ouverture et à la mobilité. L'équivocité que partagent les avatars des deux frères bibliques s'accompagne de l'exploration de la richesse d'un parcours caïnique tendu entre meurtre et création. L'ambiguïté de cet inténaire est idéale pour figurer le travail du négatif, la fécondité des déchirures, le processus de séparation et d'individuation autant d'éléments formulés par les penseurs de la modernité. Homo Faber, Caïn le civilisateur épouse la crise de la raison, ses risques de dérive vers la barbarie technicienne. Mais, père des artistes, il révèle aussi l'opposition entre monde hétéroclite de la vie et monde harmonieux de l'art, et la fonction d'antidote dévolue à celui-ci par une modernité qui cherche à unifier ses multiples fractures. Figure tragique mais porteuse d'espoir, le nouveau Caïn est placé au centre du processus dialectique de la création littéraire
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Chao-chung, and 陳照中. "A Spatially Weighted Tag System with Shared Secrets for Low Cost RFID Privacy." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/95150935043896175406.

Full text
Abstract:
碩士
義守大學
資訊工程學系碩士班
97
The privacy protection of RFID is often provided by encryption with key exchange. Encryption can work well in controlled systems such as payment cards and identification systems. But the key management problem and the high tag cost with computing capability prohibit the practical usage from applying to large amounts of daily artifacts. The alternative option is keyless approaches, which omit the key exchange. The keyless approaches use the unfair computing conditions between legal and illegal readers to shield tag from attacking, e.g. time and distance. A unified protection system is proposed in this paper for RFID privacy with low cost tags. Similar to those recent published systems, such as the pseudonym list with database support, Shamir tag with bit throttling, and spatially distributed secret shares, the proposed system uses keyless approaches. The system is consisted of three phases: Shares Construction, Shares Deployment, and Secret Reconstruction. In the phase of Shares Construction, two techniques are suggested: The Weighted Tag is used to achieve the pseudonym effect. And the Hash- Value Appended Discriminator (HVAD) is designed to provide noise tolerance ability. The Secret Sharing is kept in the system to avoid part of information leaking due to incomplete reading process. Additionally, two privacy evaluation values are suggested in the phase of shares deployment: the tag importance to a group (IMPG) and the density of pseudonym (DOP). To fully utilize the unfair computing conditions, tags are required to be distributed as apart as possible among the area. Otherwise, tags with higher IMPG value should be deployed into an area with higher DOP value.
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Ying-Cun, and 陳映存. "Wiretap Channel with Shared Secret Key and Side Information at the Transmitter." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/45jx2b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Yu-Wei, and 陳昱瑋. "Secret image sharing with meaningful shares based on random grids." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/3b666z.

Full text
Abstract:
碩士
國立臺中科技大學
資訊工程系碩士班
105
Visual secret sharing scheme (VSS) encodes secret information into several share images. Users can decrypt the secret by human vision without any computation. Naor and Shamir proposed the threshold-based secret sharing scheme. Each shadow can be made on transparency. And any k or more noise shadows can reveal the secret by overlapping transparencies where k is the secret revealed threshold. Moreover, the random grid based on visual secret sharing has the advantages of avoiding pixel expansion problem and without codebook design. The proposed (k, n) threshold VSS scheme provides meaningful shares and makes share management efficiently. The secret image encoded corresponding pixels in each j-th share by random grids for j=1, 2, …, k. The last (k+1) to n shares are copied by (j mod k)-th shares for j= k+1, k+2, …, n. Then, the proposed method randomly select two corresponding pixels to be embedded the corresponding pixels of the cover image in the last k to n shares. The proposed method has little loss of contrast in revealing secret image by adjusting black pixel and white pixels.
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Hong-Hao, and 陳鴻豪. "A Study of Novel Visual Secret Sharing with Non-expansion Share Images." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/58118319204647693506.

Full text
Abstract:
碩士
國立中興大學
資訊管理學系所
98
Visual secret sharing was proposed by Naor and Shamir in 1995. Visual secret sharing schemes encode a secret image into two or more share images, and single share image can not obtain any information about the secret image. The manager distributes these share images to different participants. The secret image can be recovered by stacking the qualified set of share images. On the contrary, nothing can be obtained if the set is unqualified. The main issues of visual secret sharing are how to reduce expansion rate and raise revealing contrast of the recovered secret image. Therefore, this thesis proposes two visual secret sharing schemes without pixel expansion and provides better quality of the recovered secret image. The first scheme is based on pixel swapping technique. This scheme embeds a main secret and an extra confidential image into two cover images. Both of the generated share images are meaningful. People can obtain the main secret image by stacking the share images together, and the extra confidential image can be revealed by shifting one of the share images for certain units for authentication. Except for sharing binary secret image, this scheme can also apply to share color secret image. The second scheme encodes a grayscale secret image into two share images with six kinds of gray levels. This scheme provides better visual quality of recovered secret image. In decoding process, the properties of non-expansion and high recovered image quality preserve the characteristics of original secret image; so that the recovered secret information can be recognized correctly, correctness is raised. Furthermore, the meaningful share images in the first scheme and high quality of share images do not attract to attackers and easy for management, security is enhanced.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Shared secrets"

1

Shared secrets. [Mbabane?: s.n., 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Secrets not shared. Bath, England: Chivers Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Building a business: The secrets shared! Singapore: Straits Times Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

(Organization), WriteGirl, ed. Listen to me: Shared secrets from WriteGirl. Los Angeles, Calif: WriteGirl, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dean, Jennifer Kennedy. Secrets Jesus shared: Kingdom insights revealed through the parables. Birmingham, Ala: New Hope Publishers, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

How to become a better grandparent: 50 never before shared secrets. [Place of publication not identified]: Pards Productions, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Conversations with sharks: Success secrets shared by the sharks on ABC's hit TV show Shark Tank. Place of publication not identified: Prime Time Marketing, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boss of me!: The pocketbook of big thinking : 20 power secrets to remember as shared by Singapore's movers and shakers. Singapore: Armour Pub., 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Thompson, Carlene. Share no secrets. New York: St. Martin's Paperbacks, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Thompson, Carlene. Share no secrets. New York: St. Martin's Press, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Shared secrets"

1

Alwen, Joël, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov. "Anonymous Authentication with Shared Secrets." In Progress in Cryptology - LATINCRYPT 2014, 219–36. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16295-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Traverso, Giulia, Denise Demirel, and Johannes Buchmann. "Performing Computations on Hierarchically Shared Secrets." In Progress in Cryptology – AFRICACRYPT 2018, 141–61. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89339-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

He, J., and E. Dawson. "On the Reconstruction of Shared Secrets." In Information Systems Security, 209–18. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-5041-2919-0_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sang, Lifeng, and Anish Arora. "A Wireless Security Framework without Shared Secrets." In Lecture Notes in Computer Science, 609–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05118-0_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mauw, Sjouke, Zach Smith, Jorge Toro-Pozo, and Rolando Trujillo-Rasua. "Automated Identification of Desynchronisation Attacks on Shared Secrets." In Computer Security, 406–26. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99073-6_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Xin, Willy Susilo, and Joonsang Baek. "Secure Computation of Shared Secrets and Its Applications." In Information Security Applications, 119–31. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-89432-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Troiano, Luigi, Irene Díaz, and Luis J. Rodríguez-Muñiz. "A Model for Assessing the Risk of Revealing Shared Secrets in Social Networks." In Communications in Computer and Information Science, 499–508. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31724-8_52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

van Ditmarsch, Hans, and Malvin Gattinger. "The Limits to Gossip: Second-Order Shared Knowledge of All Secrets is Unsatisfiable." In Logic, Language, Information, and Computation, 237–49. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15298-6_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chase, Melissa, Esha Ghosh, and Oxana Poburinnaya. "Secret-Shared Shuffle." In Advances in Cryptology – ASIACRYPT 2020, 342–72. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64840-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mödinger, David, Juri Dispan, and Franz J. Hauck. "Shared-Dining: Broadcasting Secret Shares Using Dining-Cryptographers Groups." In Distributed Applications and Interoperable Systems, 83–98. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78198-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Shared secrets"

1

Safaka, Iris, Christina Fragouli, Katerina Argyraki, and Suhas Diggavi. "Creating shared secrets out of thin air." In the 11th ACM Workshop. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2390231.2390244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Peace Akinduro, Aderonke, Boniface Kayode Alese, Olufunso Dayo Alowolodu, Aderonke Favour-Bethy Thompson, and Akintoba Emmanuel Akinwonmi. "Development of a Secured Shared Processing System." In InSITE 2015: Informing Science + IT Education Conferences: USA. Informing Science Institute, 2015. http://dx.doi.org/10.28945/2156.

Full text
Abstract:
The most common way of ensuring confidentiality of data or documents by individuals, governments, and institutions such as banks, hospitals, and other commercial enterprises is by consigning their secrets to a computer system. But this has not solved the problems of upholding security, instead they are more compounded due to the fact that secrets sharing is generally desired but only in a tightly controlled manner. This could be resolved by the introduction of a secured shared processing system. Secured shared processing system is a system that comprises of several computers whereby one stands as a secured, trusted system while the other systems are connected to it. The system do not divide up a memory or a clock; the computers only communicate with each other by exchanging messages over a communication channel; and each computer has its own memory and operates on its own operating system. This is achieved with the aid of Cryptographic mechanisms in which EI Gamal model was adopted as a Public-key cryptography scheme which will be applied on a workstation distributed System.
APA, Harvard, Vancouver, ISO, and other styles
3

Arora, Anish, and Lifeng Sang. "Symmetric dialog codes for confidential communications without shared secrets." In 2010 International Conference on Signal Processing and Communications (SPCOM). IEEE, 2010. http://dx.doi.org/10.1109/spcom.2010.5560465.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Comon, Hubert, Charlie Jacomme, and Guillaume Scerri. "Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets." In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3372297.3417229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Washio, Shinya, and Yodai Watanabe. "Security of audio secret sharing scheme encrypting audio secrets with bounded shares." In ICASSP 2014 - 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2014. http://dx.doi.org/10.1109/icassp.2014.6855037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cliff, Dave. "Simulation-based evaluation of automated trading strategies: a manifesto for modern methods." In The 19th International Conference on Modelling and Applied Simulation. CAL-TEK srl, 2019. http://dx.doi.org/10.46354/i3m.2019.mas.018.

Full text
Abstract:
In many investment banks and major fund-management companies, automated "robot" trading systems now do work that 20 years ago would have required large numbers of human traders to perform: the rise of robot traders is a major success-story for artificial intelligence (AI) research. Although the technical details of currently profitable automated trading systems are closely guarded commercial secrets, the rise of robot trading can be traced back to a sequence of key AI research papers. Each of these key papers relied on minimal abstract simulation models of real financial markets: the simulators provide test-beds for trials in which the performance of different trading strategies could be evaluated and compared. Recent studies have revisited these seminal results, using more realistic simulations of contemporary financial markets, and have cast major doubts on core conclusions drawn in the original publications. Therefore, it seems reasonable to argue that present-day simulation methods are exposing significant problems in past research on automated trading. This position paper presents no new empirical results but instead presents a review of key past papers and an argument, a manifesto, for establishing a shared market-simulator test-bed that adequately reflects current real-world financial markets, for use in future evaluation and comparison of trading strategies.
APA, Harvard, Vancouver, ISO, and other styles
7

Slutsky, Boris A., R. Rao, L. Tancevski, P. C. Sun, and Y. Fainman. "Information Leakage Estimates in Quantum Cryptography." In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.owc.2.

Full text
Abstract:
Quantum cryptography permits two parties, who share no secret information initially, to communicate over an open channel and establish between themselves a shared secret sequence of bits [1]. Quantum cryptography is provably secure against an eavesdropping attack because any attempt by a third party to monitor a quantum cryptographic channel reveals itself through transmission errors between the legitimate users.
APA, Harvard, Vancouver, ISO, and other styles
8

Galletta, Antonino, Javid Taheri, Maria Fazio, Antonio Celesti, and Massimo Villari. "Overcoming security limitations of Secret Share techniques: the Nested Secret Share." In 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). IEEE, 2021. http://dx.doi.org/10.1109/trustcom53373.2021.00054.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fundulaki, Irini, and Arnaud Sahuguet. ""Share your data, keep your secrets."." In the 2004 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1007568.1007712.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Csiszar, Imre, and Prakash Narayan. "Capacity of a shared secret key." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513769.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Shared secrets"

1

Vanderveen, M., and H. Soliman. Extensible Authentication Protocol Method for Shared-secret Authentication and Key Establishment (EAP-SAKE). RFC Editor, November 2006. http://dx.doi.org/10.17487/rfc4763.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, E., and Y. Cui. IKEv2-Derived Shared Secret Key for the One-Way Active Measurement Protocol (OWAMP) and Two-Way Active Measurement Protocol (TWAMP). Edited by K. Pentikousis. RFC Editor, December 2015. http://dx.doi.org/10.17487/rfc7717.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Covert, Thomas, and Richard Sweeney. Secrecy Rules and Exploratory Investment: Theory and Evidence from the Shale Boom. Cambridge, MA: National Bureau of Economic Research, October 2022. http://dx.doi.org/10.3386/w30548.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pinzón-Puerto, Freddy, and Mauricio Villamizar-Villegas. Do Actions Speak Louder than Words? A Foreign Exchange Intervention Analysis. Banco de la República Colombia, January 2023. http://dx.doi.org/10.32468/be.1223.

Full text
Abstract:
We revisit an old question but with a new identification strategy, namely the difference in exchange rate effects between announced (“vocal”) and secret (“dirty”) foreign exchange intervention. Using a Regression Discontinuity Design, we exploit a rule-based intervention mechanism enacted by the Central Bank of Colombia that, under observable and deterministic conditions, triggered either the issuance of FX options or the ability to exercise them. We take the former (issuance) as central bank announcements under a sharp setting, since the rule and information that triggered the issuance of options was public, and we take the latter (exercise) as secret trades under a fuzzy setting, since traders could have chosen (but were not required) to exercise their options in the following days after issuance. Our results indicate that, unconditionally, both announcements and secret trades carry similar effects. However, the effects of announcements are considerably amplified conditional on: (i) higher central bank credibility, (ii) less frequent announcements, and (iii) episodes of higher FX volatility.
APA, Harvard, Vancouver, ISO, and other styles
5

Tohti Bughda, Enver. Uyghurs in China: Personal Testimony of a Uyghur Surgeon. Institute of Development Studies (IDS), July 2021. http://dx.doi.org/10.19088/creid.2021.010.

Full text
Abstract:
Dr Enver Tohti Bughda is a qualified medical surgeon and a passionate advocate for Uyghur rights. Having been ordered to remove organs from an executed prisoner, Enver has since taken up a major role in the campaign against forced organ harvesting and is determined to bring China’s darkest secret to light. In this personal testimony, Enver shares his experience working as a surgeon in Xinjiang and reflects more broadly on the situation of Uyghurs in China, explaining that unless Uyghurs earn the sympathy and support of China’s Han majority, unless it is understood that all Chinese people are the victims of the same authoritarian regime, ethnic animosity will continue to serve the political purposes of the Chinese Communist Party (CCP).
APA, Harvard, Vancouver, ISO, and other styles
6

Dorsey, Jessica, and Nilza Amaral. Military drones in Europe. Royal Institute of International Affairs, April 2021. http://dx.doi.org/10.55317/9781784134556.

Full text
Abstract:
The use of armed drones, particularly to conduct targeted killings outside formal war zones, is highly contentious. In the contemporary context, where conflict has moved beyond the theatres of traditional warfare to take place in undefined battle zones, and is chiefly characterized by counterterrorism and counter-insurgency operations, drone use has brought to the fore critical questions on civilian casualties, the rule of law, secrecy and lack of accountability, among others. This paper has been developed as part of a project focusing on the policy implications for the UK and the EU of the use of armed drones. The analysis draws on discussions that took place at two research workshops and a simulation exercise held at Chatham House in 2019. The authors argue that the troubling questions raised by armed drone use should not just be a concern for countries that may use them in permissive ways. The EU and the UK, with a shared interest in upholding democratic values, need to work together on developing guidance on best practice for improving transparency and accountability around the use of armed drones.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhao, Bingyu, Saul Burdman, Ronald Walcott, Tal Pupko, and Gregory Welbaum. Identifying pathogenic determinants of Acidovorax citrulli toward the control of bacterial fruit blotch of cucurbits. United States Department of Agriculture, January 2014. http://dx.doi.org/10.32747/2014.7598168.bard.

Full text
Abstract:
The specific objectives of this BARD proposal were: Use a comparative genomics approach to identify T3Es in group I, II and III strains of A. citrulli. Determine the bacterial genes contributing to host preference. Develop mutant strains that can be used for biological control of BFB. Background to the topic: Bacterial fruit blotch (BFB) of cucurbits, caused by Acidovoraxcitrulli, is a devastating disease that affects watermelon (Citrulluslanatus) and melon (Cucumismelo) production worldwide, including both Israel and USA. Three major groups of A. citrullistrains have been classified based on their virulence on host plants, genetics and biochemical properties. The host selection could be one of the major factors that shape A. citrullivirulence. The differences in the repertoire of type III‐ secreted effectors (T3Es) among the three A. citrulligroups could play a major role in determining host preferential association. Currently, there are only 11 A. citrulliT3Es predicted by the annotation of the genome of the group II strain, AAC00‐1. We expect that new A. citrulliT3Es can be identified by a combination of bioinformatics and experimental approaches, which may help us to further define the relationship of T3Es and host preference of A. citrulli. Implications, both scientific and agricultural: Enriching the information on virulence and avirulence functions of T3Es will contribute to the understanding of basic aspects of A. citrulli‐cucurbit interactions. In the long term, it will contribute to the development of durable BFB resistance in commercial varieties. In the short term, identifying bacterial genes that contribute to virulence and host preference will allow the engineering of A. citrullimutants that can trigger SAR in a given host. If applied as seed treatments, these should significantly improve the effectiveness and efficacy of BFB management in melon and atermelon production.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Shared secrets' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography