References: Difference between revisions
No edit summary |
No edit summary |
||
| Line 78: | Line 78: | ||
=== Q === | === Q === | ||
=== R === | === R === | ||
{{Reference | |||
|id=rsa78 |tag=RSA78 | |||
|title=A Method for Obtaining Digital Signatures and Public-Key Cryptosystems | |||
|authors=R. L. Rivest, A. Shamir, and L. M. Adleman | |||
|journal=Communications of the ACM, Volume 21, Issue 2 | |||
|link=https://dl.acm.org/doi/10.1145/359340.359342 | |||
}} | |||
=== S === | === S === | ||
=== T === | === T === | ||
Revision as of 18:20, 27 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
[CHS24] S. Cohen, A. Hoover, and G. Schoenbach. Watermarking Language Models for Many Adaptive Users, Preprint, . https://eprint.iacr.org/2024/759
D
[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
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
I
J
K
L
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