References: Difference between revisions
No edit summary |
No edit summary |
||
| Line 77: | Line 77: | ||
}} | }} | ||
{{Reference | |||
|id=go96 |tag=GO96 | |||
|title=Software Protection and Simulation on Oblivious RAMs | |||
|authors=O. Goldreich and R. Ostrovsky | |||
|journal=Journal of the ACM (JACM) | |||
|srcdetail=Volume 43, Number 3, Pages 431--473, 1996 | |||
|link=https://doi.org/10.1145/233551.233553 | |||
}} | |||
=== H === | === H === | ||
| Line 96: | Line 104: | ||
=== I === | === I === | ||
=== J === | === J === | ||
=== K === | === K === | ||
| Line 110: | Line 116: | ||
|link=https://doi.org/10.1007/3-540-45539-6_9 | |link=https://doi.org/10.1007/3-540-45539-6_9 | ||
}} | }} | ||
=== L === | === L === | ||
| Line 121: | Line 126: | ||
}} | }} | ||
=== M === | |||
=== N === | === N === | ||
=== O === | === O === | ||
=== P === | === P === | ||
=== Q === | === Q === | ||
=== R === | === R === | ||
{{Reference | {{Reference | ||
| Line 137: | Line 146: | ||
=== S === | === S === | ||
=== T === | === T === | ||
=== U === | === U === | ||
=== V === | === V === | ||
=== W === | === W === | ||
=== X === | === X === | ||
=== Y === | === Y === | ||
=== Z === | === Z === | ||
Revision as of 01:50, 28 June 2024
A
[CP07] Y. Chen and J. Flum. On parameterized path and chordless path problems., Proceedings of the IEEE Conference on Computational Complexity 2007, 250-263.
B
C
[CDH20] D. Cash, A. Drucker, and A. Hoover. A Lower Bound for One-Round Oblivious RAM, TCC, 2020. https://eprint.iacr.org/2020/1195
[CHNVW16] A. Cohen, J. Holmgren, R. Nishimaki, V. Vaikuntanathan, and D. Wichs. Watermarking Cryptographic Capabilities, STOC, Pages 1115--1127, 2016. https://doi.org/10.1145/2897518.2897651
[CHS24] S. Cohen, A. Hoover, and G. Schoenbach. Watermarking Language Models for Many Adaptive Users, Preprint, . https://eprint.iacr.org/2024/759
D
[DMO00] G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single Database Private Information Retrieval Implies Oblivious Transfer, EUROCRYPT, Pages 122--138, 2000. https://doi.org/10.1007/3-540-45539-6_10
[DH76] W. Diffie and M. E. Hellman. New Directions in Cryptography, IEEE Transactions on Information Theory, . https://ieeexplore.ieee.org/document/1055638
E
[E85] T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm, IEEE Transactions on Information Theory, . https://ieeexplore.ieee.org/abstract/document/1057074
F
G
[GGM84] O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions (Extended Abstract), FOCS, Pages 464--479, 1984. https://dl.acm.org/doi/abs/10.1145/6490.6503
[GO96] O. Goldreich and R. Ostrovsky. Software Protection and Simulation on Oblivious RAMs, Journal of the ACM (JACM), Volume 43, Number 3, Pages 431--473, 1996. https://doi.org/10.1145/233551.233553
H
[HPPY24] A. Hoover, S. Patel, G. Persiano, and K. Yeo. Plinko: Single-Server PIR with Efficient Updates via Invertible PRFs, Preprint, . https://eprint.iacr.org/2024/318
[HILL99] J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, Volume 28, Number 4, Pages 1364--1396, 1999.
I
J
K
[KO00] E. Kushilevitz and R. Ostrovsky. One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval, EUROCRYPT, Pages 104--121, 2000. https://doi.org/10.1007/3-540-45539-6_9
L
[LR88] M. Luby and C. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions, SIAM Journal on Computing, Volume 17, Number 2, 1988.
M
N
O
P
Q
R
[RSA78] R. L. Rivest, A. Shamir, and L. M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Volume 21, Issue 2, . https://dl.acm.org/doi/10.1145/359340.359342