Academic literature on the topic 'Shared secrets'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
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"
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 textXu, 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 textLuca, 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 textSeitz, Frederick. "How allies shared radar secrets." Nature 384, no. 6608 (December 1996): 424–25. http://dx.doi.org/10.1038/384424a0.
Full textWu, 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 textErrahmani, 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 textBadra, 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 textBai, 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 textFrijns, 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 textJENSEN, 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 textDissertations / Theses on the topic "Shared secrets"
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 textThesis (PhD)--University of Pretoria, 2012.
Anthropology and Archaeology
unrestricted
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 textThesis: 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
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 textHealth, 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
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 textLichtenberg, 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 textLé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 textChen, 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義守大學
資訊工程學系碩士班
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.
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 textChen, Yu-Wei, and 陳昱瑋. "Secret image sharing with meaningful shares based on random grids." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/3b666z.
Full text國立臺中科技大學
資訊工程系碩士班
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.
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國立中興大學
資訊管理學系所
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.
Books on the topic "Shared secrets"
Shared secrets. [Mbabane?: s.n., 2001.
Find full textSecrets not shared. Bath, England: Chivers Press, 1991.
Find full textBuilding a business: The secrets shared! Singapore: Straits Times Press, 2010.
Find full text(Organization), WriteGirl, ed. Listen to me: Shared secrets from WriteGirl. Los Angeles, Calif: WriteGirl, 2008.
Find full textDean, Jennifer Kennedy. Secrets Jesus shared: Kingdom insights revealed through the parables. Birmingham, Ala: New Hope Publishers, 2007.
Find full textHow to become a better grandparent: 50 never before shared secrets. [Place of publication not identified]: Pards Productions, 2009.
Find full textConversations 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 textBoss 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 textThompson, Carlene. Share no secrets. New York: St. Martin's Paperbacks, 2005.
Find full textThompson, Carlene. Share no secrets. New York: St. Martin's Press, 2005.
Find full textBook chapters on the topic "Shared secrets"
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 textTraverso, 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 textHe, 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 textSang, 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 textMauw, 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 textLiu, 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 textTroiano, 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 textvan 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 textChase, 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 textMö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 textConference papers on the topic "Shared secrets"
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 textPeace 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 textArora, 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 textComon, 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 textWashio, 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 textCliff, 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 textSlutsky, 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 textGalletta, 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 textFundulaki, 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 textCsiszar, 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 textReports on the topic "Shared secrets"
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 textZhang, 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 textCovert, 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 textPinzó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 textTohti 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 textDorsey, Jessica, and Nilza Amaral. Military drones in Europe. Royal Institute of International Affairs, April 2021. http://dx.doi.org/10.55317/9781784134556.
Full textZhao, 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