Log in

Relevant bibliographies by topics / Codes for Private Information Retrieval / Journal articles

To see the other types of publications on this topic, follow the link: Codes for Private Information Retrieval.

Journal articles on the topic 'Codes for Private Information Retrieval'

Author: Grafiati

Published: 6 September 2023

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Codes for Private Information Retrieval.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zhang, Yiwei, Xin Wang, Hengjia Wei, and Gennian Ge. "On Private Information Retrieval Array Codes." IEEE Transactions on Information Theory 65, no. 9 (September 2019): 5565–73. http://dx.doi.org/10.1109/tit.2019.2920635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Krishnan K. H., Murali, and Jagadeesh Harshan. "On the Existence of XOR-Based Codes for Private Information Retrieval with Private Side Information." Entropy 23, no. 10 (September 30, 2021): 1287. http://dx.doi.org/10.3390/e23101287.

Full text

Abstract:

We consider the problem of Private Information Retrieval with Private Side Information (PIR-PSI), wherein the privacy of the demand and the side information are jointly preserved. Although the capacity of the PIR-PSI setting is known, we observe that the underlying capacity-achieving code construction uses Maximum Distance Separable (MDS) codes therefore contributing to high computational complexity when retrieving the demand. Pointing at this drawback of MDS-based PIR-PSI codes, we propose XOR-based PIR-PSI codes for a simple yet non-trivial setting of two non-colluding databases and two side information files at the user. Although our codes offer substantial reduction in complexity when compared to MDS-based codes, the code-rate marginally falls short of the capacity of the PIR-PSI setting. Nevertheless, we show that our code-rate is strictly higher than that of XOR-based codes for PIR with no side information. As a result, our codes can be useful when privately downloading a file especially after having downloaded a few other messages privately from the same database at an earlier time-instant.

APA, Harvard, Vancouver, ISO, and other styles

3

Freij-Hollanti, Ragnar, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David Karpuk, and Ivo Kubjas. "$t$-private information retrieval schemes using transitive codes." IEEE Transactions on Information Theory 65, no. 4 (April 2019): 2107–18. http://dx.doi.org/10.1109/tit.2018.2871050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Jie, David Karpuk, and Camilla Hollanti. "Towards Practical Private Information Retrieval From MDS Array Codes." IEEE Transactions on Communications 68, no. 6 (June 2020): 3415–25. http://dx.doi.org/10.1109/tcomm.2020.2980833.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lavauzelle, Julien, Razane Tajeddine, Ragnar Freij-Hollanti, and Camilla Hollanti. "Private Information Retrieval Schemes With Product-Matrix MBR Codes." IEEE Transactions on Information Forensics and Security 16 (2021): 441–50. http://dx.doi.org/10.1109/tifs.2020.3003572.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tian, Chao, Hua Sun, and Jun Chen. "A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems." Information 14, no. 1 (January 11, 2023): 44. http://dx.doi.org/10.3390/info14010044.

Full text

Abstract:

We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook generation and the binning technique is proposed. This coding scheme reveals a hidden connection between PIR and the classic multiple description source coding problem. We first show that when the retrieval rate is kept optimal, the proposed non-linear scheme can achieve better performance over any linear scheme. Moreover, a non-trivial storage-retrieval rate trade-off can be achieved beyond space-sharing between this extreme point and the other optimal extreme point, achieved by the retrieve-everything strategy. We further show that with a method akin to the expurgation technique, one can extract a zero-error PIR code from the random code. Outer bounds are also studied and compared to establish the superiority of the non-linear codes over linear codes.

APA, Harvard, Vancouver, ISO, and other styles

7

Zhou, Ruida, Chao Tian, Hua Sun, and Tie Liu. "Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size." IEEE Transactions on Information Theory 66, no. 8 (August 2020): 4904–16. http://dx.doi.org/10.1109/tit.2020.2977073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kumar, Siddhartha, Hsuan-Yin Lin, Eirik Rosnes, and Alexandre Graell i Amat. "Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes." IEEE Transactions on Information Theory 65, no. 7 (July 2019): 4243–73. http://dx.doi.org/10.1109/tit.2019.2900313.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Goldreich, Oded, Howard Karloff, Leonard J. Schulman, and Luca Trevisan. "Lower bounds for linear locally decodable codes and private information retrieval." computational complexity 15, no. 3 (October 2006): 263–96. http://dx.doi.org/10.1007/s00037-006-0216-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lavauzelle, Julien, and Jade Nardi. "Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval." IEEE Transactions on Information Theory 67, no. 1 (January 2021): 111–23. http://dx.doi.org/10.1109/tit.2020.3020752.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Tian, Chao, Hua Sun, and Jun Chen. "Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost." IEEE Transactions on Information Theory 65, no. 11 (November 2019): 7613–27. http://dx.doi.org/10.1109/tit.2019.2918207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Wei, Yi-Peng, Batuhan Arasli, Karim Banawan, and Sennur Ulukus. "The Capacity of Private Information Retrieval from Decentralized Uncoded Caching Databases." Information 10, no. 12 (November 28, 2019): 372. http://dx.doi.org/10.3390/info10120372.

Full text

Abstract:

We consider the private information retrieval (PIR) problem from decentralized uncoded caching databases. There are two phases in our problem setting, a caching phase, and a retrieval phase. In the caching phase, a data center containing all the K files, where each file is of size L bits, and several databases with storage size constraint μ K L bits exist in the system. Each database independently chooses μ K L bits out of the total K L bits from the data center to cache through the same probability distribution in a decentralized manner. In the retrieval phase, a user (retriever) accesses N databases in addition to the data center, and wishes to retrieve a desired file privately. We characterize the optimal normalized download cost to be D * = ∑ n = 1 N + 1 N n - 1 μ n - 1 ( 1 - μ ) N + 1 - n 1 + 1 n + ⋯ + 1 n K - 1 . We show that uniform and random caching scheme which is originally proposed for decentralized coded caching by Maddah-Ali and Niesen, along with Sun and Jafar retrieval scheme which is originally proposed for PIR from replicated databases surprisingly results in the lowest normalized download cost. This is the decentralized counterpart of the recent result of Attia, Kumar, and Tandon for the centralized case. The converse proof contains several ingredients such as interference lower bound, induction lemma, replacing queries and answering string random variables with the content of distributed databases, the nature of decentralized uncoded caching databases, and bit marginalization of joint caching distributions.

APA, Harvard, Vancouver, ISO, and other styles

13

Sun, Hua, and Chao Tian. "Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding." Information 10, no. 9 (August 22, 2019): 265. http://dx.doi.org/10.3390/info10090265.

Full text

Abstract:

The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes was previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably in the databases. This assumption was also usually made in other related works in the literature, and this capacity is usually referred to as the MDS-PIR capacity colloquially. In this work, we considered the question of if and when this capacity barrier can be broken through joint encoding and storing of the messages. Our main results are two classes of novel code constructions, which allow joint encoding, as well as the corresponding PIR protocols, which indeed outperformed the separate MDS-coded systems. Moreover, we show that a simple, but novel expansion technique allows us to generalize these two classes of codes, resulting in a wider range of the cases where this capacity barrier can be broken.

APA, Harvard, Vancouver, ISO, and other styles

14

Jin, Lingfei, Haibin Kan, Yuan Luo, and Wenqin Zhang. "Binary Locally Repairable Codes With Large Availability and its Application to Private Information Retrieval." IEEE Transactions on Information Theory 68, no. 4 (April 2022): 2203–10. http://dx.doi.org/10.1109/tit.2022.3144034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Freij-Hollanti, Ragnar, Oliver W. Gnilke, Camilla Hollanti, and David A. Karpuk. "Private Information Retrieval from Coded Databases with Colluding Servers." SIAM Journal on Applied Algebra and Geometry 1, no. 1 (January 2017): 647–64. http://dx.doi.org/10.1137/16m1102562.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Banawan, Karim, and Sennur Ulukus. "The Capacity of Private Information Retrieval From Coded Databases." IEEE Transactions on Information Theory 64, no. 3 (March 2018): 1945–56. http://dx.doi.org/10.1109/tit.2018.2791994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Allaix, Matteo, Lukas Holzbaur, Tefjol Pllaha, and Camilla Hollanti. "Quantum Private Information Retrieval From Coded and Colluding Servers." IEEE Journal on Selected Areas in Information Theory 1, no. 2 (August 2020): 599–610. http://dx.doi.org/10.1109/jsait.2020.3015089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Heidarzadeh, Anoosheh, Fatemeh Kazemi, and Alex Sprintson. "The Role of Coded Side Information in Single-Server Private Information Retrieval." IEEE Transactions on Information Theory 67, no. 1 (January 2021): 25–44. http://dx.doi.org/10.1109/tit.2020.3029314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhu, Jinbao, Qifa Yan, and Xiaohu Tang. "Multi-User Blind Symmetric Private Information Retrieval From Coded Servers." IEEE Journal on Selected Areas in Communications 40, no. 3 (March 2022): 815–31. http://dx.doi.org/10.1109/jsac.2022.3142352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Tajeddine, Razane, Oliver W. Gnilke, and Salim El Rouayheb. "Private Information Retrieval From MDS Coded Data in Distributed Storage Systems." IEEE Transactions on Information Theory 64, no. 11 (November 2018): 7081–93. http://dx.doi.org/10.1109/tit.2018.2815607.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Henry, Ryan. "Polynomial Batch Codes for Efficient IT-PIR." Proceedings on Privacy Enhancing Technologies 2016, no. 4 (October 1, 2016): 202–18. http://dx.doi.org/10.1515/popets-2016-0036.

Full text

Abstract:

Abstract Private information retrieval (PIR) is a way for clients to query a remote database without the database holder learning the clients’ query terms or the responses they generate. Compelling applications for PIR are abound in the cryptographic and privacy research literature, yet existing PIR techniques are notoriously inefficient. Consequently, no such PIRbased application to date has seen real-world at-scale deployment. This paper proposes new “batch coding” techniques to help address PIR’s efficiency problem. The new techniques exploit the connection between ramp secret sharing schemes and efficient information-theoretically secure PIR (IT-PIR) protocols. This connection was previously observed by Henry, Huang, and Goldberg (NDSS 2013), who used ramp schemes to construct efficient “batch queries” with which clients can fetch several database records for the same cost as fetching a single record using a standard, non-batch query. The new techniques in this paper generalize and extend those of Henry et al. to construct “batch codes” with which clients can fetch several records for only a fraction the cost of fetching a single record using a standard non-batch query over an unencoded database. The batch codes are highly tuneable, providing a means to trade off (i) lower server-side computation cost, (ii) lower server-side storage cost, and/or (iii) lower uni- or bi-directional communication cost, in exchange for a comparatively modest decrease in resilience to Byzantine database servers.

APA, Harvard, Vancouver, ISO, and other styles

22

Holzbaur, Lukas, Ragnar Freij-Hollanti, Jie Li, and Camilla Hollanti. "Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers." IEEE Transactions on Information Theory 68, no. 1 (January 2022): 517–37. http://dx.doi.org/10.1109/tit.2021.3120316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Tajeddine, Razane, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, and Camilla Hollanti. "Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers." IEEE Transactions on Information Theory 65, no. 6 (June 2019): 3898–906. http://dx.doi.org/10.1109/tit.2018.2890285.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Zhang, Yiwei, and Gennian Ge. "A general private information retrieval scheme for MDS coded databases with colluding servers." Designs, Codes and Cryptography 87, no. 11 (May 17, 2019): 2611–23. http://dx.doi.org/10.1007/s10623-019-00640-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Allaix, Matteo, Seunghoan Song, Lukas Holzbaur, Tefjol Pllaha, Masahito Hayashi, and Camilla Hollanti. "On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers." IEEE Journal on Selected Areas in Communications 40, no. 3 (March 2022): 885–98. http://dx.doi.org/10.1109/jsac.2022.3142363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tsai, Chwei-Shyong, Hsin-Liang Chen, Hsien-Chu Wu, and Josh Jia-Ching Ying. "A Puzzle-Based Data Sharing Approach with Cheating Prevention Using QR Code." Symmetry 13, no. 10 (October 8, 2021): 1896. http://dx.doi.org/10.3390/sym13101896.

Full text

Abstract:

The information technique has developed rapidly. The technique of QR codes is widely applied in our daily life, and the mechanism is suitable to share data. A QR code uses symmetric encryption to store and retrieve data efficiently. However, the security issues of QR codes are seldom discussed by the wider community. Moreover, if the sender wishes only the authorized participant to attain the private data which are shared, the data must be encrypted. Furthermore, we do not know who should be censured when problems arise. In view of this, to maintain the integrity and the confidentiality of information security, this paper proposed a new puzzle-based data sharing scheme to share the private information safely. Firstly, we generated the digital signature of the information, then applied the random grids algorithm to obtain the shares. Then, we disarrayed the shares which contain the information and the digital signature with a puzzle-based encoding method. Afterwards, we concealed them into the cover QR codes. With the QR code mechanism of error correction, the marked QR code remain meaningful. Finally, we could send marked QR codes via transmission. The receiver could use XOR operation to obtain the private information after solving the puzzles and verify whether it was tampered with by the digital signature. The proposed system can recover the lossless data and protect them from being divulged. To deal with the potential hazard of transmission in a public environment, there are more and more studies on data hiding and image authentication.

APA, Harvard, Vancouver, ISO, and other styles

27

Wang, Qiwen, and Mikael Skoglund. "Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers." IEEE Transactions on Information Theory 65, no. 8 (August 2019): 5160–75. http://dx.doi.org/10.1109/tit.2019.2903206.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Jia, Zhuqing, and Syed Ali Jafar. "X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers." IEEE Transactions on Information Theory 66, no. 12 (December 2020): 7427–38. http://dx.doi.org/10.1109/tit.2020.3013152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

KURIHARA, Jun, Toru NAKAMURA, and Ryu WATANABE. "Private Information Retrieval from Coded Storage in the Presence of Omniscient and Limited-Knowledge Byzantine Adversaries." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E104.A, no. 9 (September 1, 2021): 1271–83. http://dx.doi.org/10.1587/transfun.2020dmp0018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Zhu, Jinbao, Qifa Yan, Chao Qi, and Xiaohu Tang. "A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers." IEEE Transactions on Information Forensics and Security 15 (2020): 1248–60. http://dx.doi.org/10.1109/tifs.2019.2937634.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Sun, Hua, and Syed Ali Jafar. "Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al." IEEE Transactions on Information Theory 64, no. 2 (February 2018): 1000–1022. http://dx.doi.org/10.1109/tit.2017.2779454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Yekhanin, Sergey. "Private information retrieval." Communications of the ACM 53, no. 4 (April 2010): 68–73. http://dx.doi.org/10.1145/1721654.1721674.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Chor, Benny, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan. "Private information retrieval." Journal of the ACM 45, no. 6 (November 1998): 965–81. http://dx.doi.org/10.1145/293347.293350.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Yi, Xun, Russell Paulet, and Elisa Bertino. "Private Information Retrieval." Synthesis Lectures on Information Security, Privacy, and Trust 4, no. 2 (September 20, 2013): 1–114. http://dx.doi.org/10.2200/s00524ed1v01y201307spt005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Tipaldo, Kristen, Azizi Seixas, Maurice Chery, Maritza Bernard, Girardin Jean-Louis, and Judite Blanc. "0341 Acupuncture and Its Effects on Various Patterns of Insomnia." SLEEP 46, Supplement_1 (May 1, 2023): A151—A152. http://dx.doi.org/10.1093/sleep/zsad077.0341.

Full text

Abstract:

Abstract Introduction Acupuncture has been shown to treat Insomnia. Insomnia is classified as difficulty falling asleep and staying asleep, waking up throughout the night, and waking up early, which is associated with decreased daytime function, mental health, and cardiometabolic health. The purpose of our study is to describe a series of 12 cases seen in an Acupuncture Clinic in Tampa for symptoms of Insomnia. Methods We used intakes from eight females, seven Caucasians, one African American, and four Caucasian males aged 30-65 and assessed information through Acupuncture systems. Patients were seen for Insomnia along with other treatable symptoms between January 2019 and October 2022. Information on Gynecological, Orthopedic, Genito-Urinary, Psycho-Emotional, Gastrointestinal, Respiratory, Ear/Nose/Throat, Neurological, Endocrine, and Allergic/Immunologic were collected. Follow-up intake information and Subjective, Objective, Assessment Plan (SOAP) notes were conducted during each visit through the electronic medical system. Differential diagnosis, as well as ICD codes, are housed within the system. The Acupuncture method utilized was Traditional Chinese Medicine (TCM) and not dry needling, which does not include a differential diagnosis and is typically used for Orthopedic conditions. Results We retrieved data from twelve patients, eight women and four men receiving Acupuncture treatment in private practice. The mean age of the sample was 46.91 [30-65] years. Of the 12 patients, 10 of them fully recovered after treatment. Among those who fully recovered, treatments ranged as low as two up to 14, with three patients receiving six treatments and one receiving 14. One patient discontinued treatment after six treatments with a slight change to differential insomnia pattern. One patient received fourteen treatments with only partial remission to differential insomnia pattern. Conclusion Acupuncture may be an effective modality in treating Insomnia, regardless of the pattern. Further studies are necessary to determine the mechanism of action. Support (if any) R01HL152453, R01MD007716, and R01HL142066

APA, Harvard, Vancouver, ISO, and other styles

36

Vithana, Sajani, Karim Banawan, and Sennur Ulukus. "Semantic Private Information Retrieval." IEEE Transactions on Information Theory 68, no. 4 (April 2022): 2635–52. http://dx.doi.org/10.1109/tit.2021.3136583.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

ANDRIU, Adrian-Viorel. "PIR – Private Information Retrieval." Romanian Cyber Security Journal 4, no. 2 (November 3, 2022): 65–70. http://dx.doi.org/10.54851/v4i2y202207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Kadhe, Swanand, Brenden Garcia, Anoosheh Heidarzadeh, Salim El Rouayheb, and Alex Sprintson. "Private Information Retrieval With Side Information." IEEE Transactions on Information Theory 66, no. 4 (April 2020): 2032–43. http://dx.doi.org/10.1109/tit.2019.2948845.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Beimel, Amos, and Yoav Stahl. "Robust Information-Theoretic Private Information Retrieval." Journal of Cryptology 20, no. 3 (July 2007): 295–321. http://dx.doi.org/10.1007/s00145-007-0424-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Samy, Islam, Mohamed Attia, Ravi Tandon, and Loukas Lazos. "Asymmetric Leaky Private Information Retrieval." IEEE Transactions on Information Theory 67, no. 8 (August 2021): 5352–69. http://dx.doi.org/10.1109/tit.2021.3085363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Toledo, Raphael R., George Danezis, and Ian Goldberg. "Lower-Cost ∈-Private Information Retrieval." Proceedings on Privacy Enhancing Technologies 2016, no. 4 (October 1, 2016): 184–201. http://dx.doi.org/10.1515/popets-2016-0035.

Full text

Abstract:

Abstract Private Information Retrieval (PIR), despite being well studied, is computationally costly and arduous to scale. We explore lower-cost relaxations of information-theoretic PIR, based on dummy queries, sparse vectors, and compositions with an anonymity system. We prove the security of each scheme using a flexible differentially private definition for private queries that can capture notions of imperfect privacy. We show that basic schemes are weak, but some of them can be made arbitrarily safe by composing them with large anonymity systems.

APA, Harvard, Vancouver, ISO, and other styles

42

Kerenidis, Iordanis, and Ronald de Wolf. "Quantum symmetrically-private information retrieval." Information Processing Letters 90, no. 3 (May 2004): 109–14. http://dx.doi.org/10.1016/j.ipl.2004.02.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Junnila, Ville, and Tero Laihonen. "Codes for Information Retrieval With Small Uncertainty." IEEE Transactions on Information Theory 60, no. 2 (February 2014): 976–85. http://dx.doi.org/10.1109/tit.2013.2290045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Schulte, Stephanie J. "Information Professional Job Advertisements in the U.K. Indicate Professional Experience is the Most Required Skill." Evidence Based Library and Information Practice 4, no. 2 (June 14, 2009): 158. http://dx.doi.org/10.18438/b8ts51.

Full text

Abstract:

A Review of: Orme, Verity. “You will be…: A Study of Job Advertisements to Determine Employers’ Requirements for LIS Professionals in the UK in 2007.” Library Review 57.8 (2008): 619-33. Objective –To determine what skills employers in the United Kingdom (U.K.) want from information professionals as revealed through their job advertisements. Design – Content analysis, combining elements of both quantitative and qualitative content analysis. Orme describes it as “a descriptive non-experimental approach of content analysis” (62). Setting – Data for this study were obtained from job advertisements in the Chartered Institute of Library and Information Professional’s (CILIP) Library and Information Gazette published from June 2006 through May 2007. Subjects – A total of 180 job advertisements. Methods – Job advertisements were selected using a random number generator, purposely selecting only 15 advertisements per first issue of each month of the Library and Information Gazette (published every two weeks). The author used several sources to create an initial list of skills required by information professionals, using such sources as prior studies that examined this topic, the Library and Information Science Abstracts (LISA) database thesaurus, and personal knowledge. Synonyms for the skills were then added to the framework for coding. Skills that were coded had to be noted in such a way that the employer plainly stated the employee would be a certain skill or attribute or they were seeking a skill or a particular skill was essential or desirable. Skills that were stated in synonymous ways within the same advertisement were counted as two incidences of that skill. Duties for the position were not counted unless they were listed as a specific skill. Data were all coded by hand and then tallied. The author claims to have triangulated the results of this study with the literature review, the synonym ring used to prepare the coding framework, and a few notable studies. Main Results – A wide variety of job titles was observed, including “Copyright Clearance Officer,” “Electronic Resources and Training Librarian,” and “Assistant Information Advisor.” Employers represented private, school, and university libraries, as well as legal firms and prisons. Fifty-nine skills were found a total of 1,021 times across all of the advertisements. Each advertisement averaged 5.67 requirements. These skills were classified in four categories: professional, generic, personal, and experience. The most highly noted requirement was professional experience, noted 129 times, followed by interpersonal/communication skills (94), general computing skills (63), enthusiasm (48), and team-working skills (39). Professional skills were noted just slightly more than generic and personal skills in the top twenty skills found. Other professional skills that were highly noted were customer service skills (34), chartership (30), cataloguing/classification/metadata skills (25), and information retrieval skills (20). Some notable skills that occurred rarely included Web design and development skills (6), application of information technology in the library (5), and knowledge management skills (3). Conclusion – Professional, generic, and personal qualities were all important to employers in the U.K.; however, without experience, possessing these qualities may not be enough for new professionals in the field.

APA, Harvard, Vancouver, ISO, and other styles

45

Shmuel, Ori, and Asaf Cohen. "Private Information Retrieval Over Gaussian MAC." IEEE Transactions on Information Theory 67, no. 8 (August 2021): 5404–19. http://dx.doi.org/10.1109/tit.2021.3078851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lu, Yuxiang, Zhuqing Jia, and Syed A. Jafar. "Double Blind T-Private Information Retrieval." IEEE Journal on Selected Areas in Information Theory 2, no. 1 (March 2021): 428–40. http://dx.doi.org/10.1109/jsait.2021.3053481.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Lin, Hsuan-Yin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, and Eitan Yaakobi. "Multi-Server Weakly-Private Information Retrieval." IEEE Transactions on Information Theory 68, no. 2 (February 2022): 1197–219. http://dx.doi.org/10.1109/tit.2021.3126865.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Wang, Tian-Yin, Xiao-Qiu Cai, and Rui-Ling Zhang. "Fault-tolerant symmetrically-private information retrieval." International Journal of Modern Physics B 30, no. 25 (September 28, 2016): 1650178. http://dx.doi.org/10.1142/s0217979216501782.

Full text

Abstract:

We propose two symmetrically-private information retrieval protocols based on quantum key distribution, which provide a good degree of database and user privacy while being flexible, loss-resistant and easily generalized to a large database similar to the precedent works. Furthermore, one protocol is robust to a collective-dephasing noise, and the other is robust to a collective-rotation noise.

APA, Harvard, Vancouver, ISO, and other styles

49

Sun, Hua, and Syed Ali Jafar. "The Capacity of Private Information Retrieval." IEEE Transactions on Information Theory 63, no. 7 (July 2017): 4075–88. http://dx.doi.org/10.1109/tit.2017.2689028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lavauzelle, Julien. "Private Information Retrieval From Transversal Designs." IEEE Transactions on Information Theory 65, no. 2 (February 2019): 1189–205. http://dx.doi.org/10.1109/tit.2018.2861747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!