Zaloguj się

Gotowe bibliografie tematyczne / Codes for Private Information Retrieval / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Codes for Private Information Retrieval.

Artykuły w czasopismach na temat „Codes for Private Information Retrieval”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Codes for Private Information Retrieval”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Lavauzelle, Julien, Razane Tajeddine, Ragnar Freij-Hollanti i 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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

13

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

14

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

22

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

27

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

KURIHARA, Jun, Toru NAKAMURA i 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, nr 9 (1.09.2021): 1271–83. http://dx.doi.org/10.1587/transfun.2020dmp0018.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Zhu, Jinbao, Qifa Yan, Chao Qi i 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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Sun, Hua, i 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, nr 2 (luty 2018): 1000–1022. http://dx.doi.org/10.1109/tit.2017.2779454.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

36

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

42

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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, nr 2 (14.06.2009): 158. http://dx.doi.org/10.18438/b8ts51.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

45

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

49

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!