Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Journal of Cryptology 78 found (118 total)

alternate case: journal of Cryptology

Ran Canetti (1,777 words) [view diff] exact match in snippet view article find links to article

Information System and Cyber Security. He is also associate editor of the Journal of Cryptology and Information and Computation. His main areas of research span
Computational Diffie–Hellman assumption (763 words) [view diff] exact match in snippet view article find links to article
Diffie–Hellman from computational Diffie–Hellman in cryptographic groups", Journal of Cryptology, 16 (4): 239–247, doi:10.1007/s00145-003-0052-4 Bao, Feng; Deng
Stuart Haber (655 words) [view diff] exact match in snippet view article find links to article
W. Scott (1991-01-01). "How to time-stamp a digital document". Journal of Cryptology. 3 (2): 99–111. doi:10.1007/BF00196791. ISSN 1432-1378. S2CID 14363020
Yehuda Lindell (960 words) [view diff] exact match in snippet view article find links to article
proof of security of Yao’s protocol for two-party computation. Journal of Cryptology, 22(2):161-188, 2009. G. Asharov and Y. Lindell. A Full Proof of
Lucifer (cipher) (749 words) [view diff] exact match in snippet view article
Ben-Aroya, Eli Biham (1996). Differential Cryptanalysis of Lucifer. Journal of Cryptology 9(1), pp. 21–34, 1996. Konheim, Alan G. (2007), Computer Security
LOKI (723 words) [view diff] exact match in snippet view article find links to article
Biham, "New Types of Cryptanalytic Attacks Using Related Keys", Journal of Cryptology, vol 7 no 4, pp 229–246, Springer-Verlag, 1994. Eli Biham, Adi Shamir
Trusted timestamping (1,285 words) [view diff] exact match in snippet view article find links to article
Stornetta, W. S. (1991). "How to time-stamp a digital document". Journal of Cryptology. 3 (2): 99–111. CiteSeerX 10.1.1.46.8740. doi:10.1007/BF00196791
Acoustic cryptanalysis (1,020 words) [view diff] exact match in snippet view article find links to article
Shamir, Adi; Tromer, Eran (2016-02-08). "Acoustic Cryptanalysis". Journal of Cryptology. 30 (2): 392–443. doi:10.1007/s00145-015-9224-2. ISSN 0933-2790
Related-key attack (688 words) [view diff] exact match in snippet view article find links to article
Eli. "New types of cryptanalytic attacks using related keys." Journal of Cryptology 7.4 (1994): 229-246. Kelsey, John, Bruce Schneier, and David Wagner
Antoine Joux (174 words) [view diff] exact match in snippet view article find links to article
Antoine (2004). "A one round protocol for tripartite Diffie-Hellman". Journal of Cryptology. 17 (4): 263–276. doi:10.1007/s00145-004-0312-y. MR 2090557. "Antoine
W. Scott Stornetta (881 words) [view diff] exact match in snippet view article find links to article
W. Scott (1991-01-01). "How to time-stamp a digital document". Journal of Cryptology. 3 (2): 99–111. doi:10.1007/BF00196791. ISSN 1432-1378. S2CID 14363020
Rank error-correcting code (1,103 words) [view diff] exact match in snippet view article find links to article
codes. However, most of them have been proven insecure (see e.g. Journal of Cryptology, April 2008). Rank codes are also useful for error and erasure correction
Provable security (2,207 words) [view diff] exact match in snippet view article find links to article
ISBN 978-3-540-60176-0. Shoup, Victor (2002), "OAEP reconsidered", Journal of Cryptology, 15 (4): 223–249, doi:10.1007/s00145-002-0133-9, S2CID 26919974
Cryptographic protocol (1,007 words) [view diff] exact match in snippet view article find links to article
Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUIC". Journal of Cryptology. 34 (3): 26. doi:10.1007/s00145-021-09389-w. ISSN 0933-2790. S2CID 235174220
Distributed key generation (1,186 words) [view diff] exact match in snippet view article find links to article
Distributed Key Generation for Discrete-Log Based Cryptosystems". Journal of Cryptology. 20 (1): 51–83. CiteSeerX 10.1.1.134.6445. doi:10.1007/s00145-006-0347-3
MD4 (840 words) [view diff] exact match in snippet view article find links to article
|journal= (help) Hans Dobbertin (1995-10-23). "Cryptanalysis of MD4". Journal of Cryptology. 11 (4): 253–271. doi:10.1007/s001459900047. S2CID 7462235. Gaëtan
DES-X (529 words) [view diff] exact match in snippet view article find links to article
(1991). "Differential cryptanalysis of DES-like cryptosystems". Journal of Cryptology. 4: 3–72. doi:10.1007/BF00630563. S2CID 33202054. Biryukov, Alex;
Dining cryptographers problem (2,131 words) [view diff] exact match in snippet view article find links to article
his. The journal version appeared in the very first issue of the Journal of Cryptology. DC-nets are readily generalized to allow for transmissions of more
Pairing-based cryptography (852 words) [view diff] exact match in snippet view article find links to article
Sylvain (2019-10-01). "Updating Key Size Estimations for Pairings". Journal of Cryptology. 32 (4): 1298–1336. doi:10.1007/s00145-018-9280-5. ISSN 1432-1378
A5/2 (561 words) [view diff] exact match in snippet view article find links to article
Ciphertext-Only Cryptanalysis of GSM Encrypted Communication" (PDF), Journal of Cryptology, 21 (3): 392–429, doi:10.1007/s00145-007-9001-y, S2CID 459117, archived
MD2 (hash function) (1,051 words) [view diff] exact match in snippet view article
Muller, Frédéric; Thomsen, Søren S. (2009). "Cryptanalysis of MD2". Journal of Cryptology. 23: 72–90. doi:10.1007/s00145-009-9054-1. S2CID 2443076. CVE-2009-2409
Oded Regev (computer scientist) (808 words) [view diff] exact match in snippet view article
"Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures". Journal of Cryptology. 22 (2): 139–160. doi:10.1007/s00145-008-9031-0. ISSN 0933-2790
Eli Biham (348 words) [view diff] exact match in snippet view article find links to article
, Dunkelman, O., & Keller, N. (2018). Efficient Slide Attacks. Journal of Cryptology, 31(3), 641–670. https://doi.org/10.1007/s00145-017-9266-8 Eli Biham's
BLS digital signature (985 words) [view diff] exact match in snippet view article find links to article
Hovav Shacham (2004). "Short Signatures from the Weil Pairing". Journal of Cryptology. 17 (4): 297–319. CiteSeerX 10.1.1.589.9141. doi:10.1007/s00145-004-0314-9
Deniable authentication (319 words) [view diff] exact match in snippet view article find links to article
Gennaro (28 May 2009). "New Approaches for Deniable Authentication". Journal of Cryptology. 22 (4): 572–615. CiteSeerX 10.1.1.59.1917. doi:10.1007/s00145-009-9044-3
Adaptive chosen-ciphertext attack (728 words) [view diff] exact match in snippet view article find links to article
Jacques (2004). "RSA-OAEP Is Secure under the RSA Assumption" (PDF). Journal of Cryptology. 17 (2): 81–104. CiteSeerX 10.1.1.11.7519. doi:10.1007/s00145-002-0204-y
Boaz Tsaban (353 words) [view diff] exact match in snippet view article find links to article
Computational Problems in Noncommutative-Algebraic Cryptography". Journal of Cryptology. 28 (3): 601–622. arXiv:1210.8114. doi:10.1007/s00145-013-9170-9
Differential cryptanalysis (1,684 words) [view diff] exact match in snippet view article find links to article
1991). "Differential cryptanalysis of DES-like cryptosystems". Journal of Cryptology. 4 (1): 3–72. doi:10.1007/BF00630563. S2CID 33202054. Biham E, Shamir
Traitor tracing (1,522 words) [view diff] exact match in snippet view article find links to article
1007/s00145-001-0006-7. Journal of Cryptology. 2001. pp. 212–213. Tamir Tassa. "Low Bandwidth Dynamic Traitor Tracing Schemes". Journal of Cryptology. 2005. pp. 167-183
Anonymous veto network (499 words) [view diff] exact match in snippet view article find links to article
David Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability Journal of Cryptology, vol. 1, No, 1, pp. 65-75, 1988
Batch cryptography (86 words) [view diff] exact match in snippet view article find links to article
Group. p. 171. ISBN 9781466501386. Amos Fiat (1997). "Batch RSA". Journal of Cryptology. 10 (2): 75–88. doi:10.1007/s001459900021. S2CID 15613430. v t e
Frobenius pseudoprime (2,150 words) [view diff] exact match in snippet view article find links to article
Primality Test with Average- and Worst-Case Error Estimate" (PDF). Journal of Cryptology. 19 (4): 489–520. doi:10.1007/s00145-006-0332-x. S2CID 34417193
Negligible function (1,140 words) [view diff] exact match in snippet view article find links to article
ISBN 0-444-86830-5. Bellare, Mihir (1997). "A Note on Negligible Functions". Journal of Cryptology. 15. Dept. of Computer Science & Engineering University of California
International Data Encryption Algorithm (1,631 words) [view diff] exact match in snippet view article find links to article
Adi (2011-08-22). "New Attacks on IDEA with at Least 6 Rounds". Journal of Cryptology. 28 (2): 209–239. doi:10.1007/s00145-013-9162-9. ISSN 0933-2790
Selim Akl (724 words) [view diff] exact match in snippet view article find links to article
Networking (Inderscience Publishers; 2003 ), and a past editor of Journal of Cryptology (Springer-Verlag; 1988–1991), Information Processing Letters (North-Holland;
HMAC (2,283 words) [view diff] exact match in snippet view article find links to article
for NMAC and HMAC: Security without Collision-Resistance" (PDF). Journal of Cryptology. Retrieved 15 December 2021. This paper proves that HMAC is a PRF
GGH signature scheme (217 words) [view diff] exact match in snippet view article find links to article
Parallelepiped: Cryptanalysis of GGH and NTRU Signatures" (PDF). Journal of Cryptology. 22 (2): 139–160. doi:10.1007/s00145-008-9031-0. eISSN 1432-1378
Hash function security summary (1,055 words) [view diff] exact match in snippet view article find links to article
Muller; Søren S. Thomsen (January 2010). "Cryptanalysis of MD2". Journal of Cryptology. 23 (1): 72–90. doi:10.1007/s00145-009-9054-1. S2CID 2443076. Yu
Supersingular isogeny graph (649 words) [view diff] exact match in snippet view article find links to article
(2009), "Cryptographic hash functions from expander graphs" (PDF), Journal of Cryptology, 22 (1): 93–113, doi:10.1007/s00145-007-9002-x, MR 2496385, S2CID 6417679
Quantum cryptography (8,940 words) [view diff] exact match in snippet view article find links to article
Charles H.; et al. (1992). "Experimental quantum cryptography". Journal of Cryptology. 5 (1): 3–28. doi:10.1007/bf00191318. S2CID 206771454. Wiesner,
Rafail Ostrovsky (394 words) [view diff] exact match in snippet view article find links to article
of the editorial board of Algorithmica [1], Editorial Board of Journal of Cryptology [2] and Editorial and Advisory Board of the International Journal
Alfred Menezes (811 words) [view diff] exact match in snippet view article find links to article
01.006 "Another look at 'provable security'" (with N. Koblitz), Journal of Cryptology, 20 (2007), 3–37. doi:10.1007/s00145-005-0432-z "An efficient protocol
Multiple encryption (1,383 words) [view diff] exact match in snippet view article find links to article
pp. 108–116, 1985. M. Maurer and J. L. Massey, Cascade ciphers: The importance of being first, Journal of Cryptology, vol. 6, no. 1, pp. 55–61, 1993.
Alan Sherman (406 words) [view diff] exact match in snippet view article find links to article
Encryption Standard a group? (Results of cycling experiments on DES), Journal of Cryptology, v.1, n.1, 1998. Baldwin, R. and Sherman, A., How we solved the
Gödel Prize (2,108 words) [view diff] exact match in snippet view article find links to article
Antoine (2004). "A one round protocol for tripartite Diffie-Hellman". Journal of Cryptology. 17 (4): 263–276. doi:10.1007/s00145-004-0312-y. MR 2090557. S2CID 3350730
David Wheeler (computer scientist) (1,419 words) [view diff] exact match in snippet view article
Gong; Wheeler, David J. (1990). "A matrix key-distribution scheme". Journal of Cryptology. 2 (1): 51–59. CiteSeerX 10.1.1.51.1279. doi:10.1007/bf02252869
Blum–Micali algorithm (394 words) [view diff] exact match in snippet view article find links to article
Pseudo-Random Generator Based on the Discrete Logarithm Problem". Journal of Cryptology. 18 (2): 91–110. doi:10.1007/s00145-004-0215-y. ISSN 0933-2790.
Server-based signatures (1,187 words) [view diff] exact match in snippet view article find links to article
O.; Micali, S. (1996). "On-line/off-line digital signatures". Journal of Cryptology. 9: 35–67. doi:10.1007/BF02254791. S2CID 9503598. Even, S.; Goldreich
Linked timestamping (1,660 words) [view diff] exact match in snippet view article find links to article
Stornetta, W. S. (1991). "How to time-stamp a digital document". Journal of Cryptology. 3 (2): 99–111. CiteSeerX 10.1.1.46.8740. doi:10.1007/BF00196791
David Pointcheval (234 words) [view diff] exact match in snippet view article find links to article
"Security Arguments for Digital Signatures and Blind Signatures" (PDF). Journal of Cryptology. 13 (3): 361–396. doi:10.1007/s001450010003. S2CID 1912537. https://www
Password Authenticated Key Exchange by Juggling (1,421 words) [view diff] exact match in snippet view article find links to article
cryptographers problem: Unconditional sender and recipient untraceability". Journal of Cryptology. 1: 65–75. doi:10.1007/BF00206326. S2CID 2664614. "CVS log for src/usr
Feige–Fiat–Shamir identification scheme (716 words) [view diff] exact match in snippet view article find links to article
Amos; Shamir, Adi (1988). "Zero-knowledge proofs of identity". Journal of Cryptology. 1 (2): 77–94. doi:10.1007/BF02351717. S2CID 2950602. Trappe, Wade;
GGH encryption scheme (801 words) [view diff] exact match in snippet view article find links to article
Parallelepiped: Cryptanalysis of GGH and NTRU Signatures" (PDF). Journal of Cryptology. 22 (2): 139–160. doi:10.1007/s00145-008-9031-0. eISSN 1432-1378
Forking lemma (1,188 words) [view diff] case mismatch in snippet view article find links to article
"Security Arguments for Digital Signatures and Blind Signatures," JOURNAL OF CRYPTOLOGY, Volume 13, pp 361--396, 2000. Available on Internet. C.P.Schnorr
Elliptic-curve cryptography (4,604 words) [view diff] exact match in snippet view article find links to article
"The discrete logarithm problem on elliptic curves of trace one". Journal of Cryptology. 12 (3): 193–196. CiteSeerX 10.1.1.17.1880. doi:10.1007/s001459900052
Secure two-party computation (1,094 words) [view diff] exact match in snippet view article find links to article
Two-Party Computation in the Presence of Malicious Adversaries". Journal of Cryptology. 28 (2): 312–350. doi:10.1007/s00145-014-9177-x. ISSN 0933-2790
Nigel Smart (cryptographer) (872 words) [view diff] exact match in snippet view article
The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, Volume 12, 1999. Barbosa et al., SK-KEM: An Identity-Based KEM
Three-pass protocol (1,293 words) [view diff] exact match in snippet view article find links to article
Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems". Journal of Cryptology. 11: 29–43. doi:10.1007/s001459900033.
Verifiable random function (1,462 words) [view diff] exact match in snippet view article find links to article
Functions from Non-interactive Witness-Indistinguishable Proofs". Journal of Cryptology. 33 (2): 459–493. doi:10.1007/s00145-019-09331-1. ISSN 1432-1378
Shlomi Dolev (2,398 words) [view diff] exact match in snippet view article find links to article
Beimel; Dolev (2003-01-01). "Buses for Anonymous Message Delivery". Journal of Cryptology. 16 (1): 25–39. CiteSeerX 10.1.1.16.1339. doi:10.1007/s00145-002-0128-6
Artin–Schreier curve (1,078 words) [view diff] exact match in snippet view article find links to article
Superelliptic curve Koblitz, Neal (1989). "Hyperelliptic cryptosystems". Journal of Cryptology. 1 (3): 139–150. doi:10.1007/BF02252872. Sullivan, Francis J. (1975)
Commitment scheme (7,469 words) [view diff] exact match in snippet view article find links to article
40-51 Naor, Moni (1991). "Bit commitment using pseudorandomness". Journal of Cryptology. 4 (2): 151–158. doi:10.1007/BF00196774. S2CID 15002247. Claude
Homomorphic encryption (4,181 words) [view diff] exact match in snippet view article find links to article
"Efficient cryptosystems from 2k-th power residue symbols" (PDF). Journal of Cryptology. 30 (2): 519–549. doi:10.1007/s00145-016-9229-5. hdl:2117/103661
Linear-feedback shift register (4,582 words) [view diff] exact match in snippet view article find links to article
Ciphertext-Only Cryptanalysis of GSM Encrypted Communication" (PDF), Journal of Cryptology, 21 (3): 392–429, doi:10.1007/s00145-007-9001-y, S2CID 459117, archived
David Chaum (2,978 words) [view diff] exact match in snippet view article find links to article
Cryptographers Problem: Unconditional Sender and Recipient Untraceability". Journal of Cryptology. 1 (1): 65–75. CiteSeerX 10.1.1.127.4293. doi:10.1007/BF00206326
Black-box obfuscation (951 words) [view diff] exact match in snippet view article find links to article
Rothblum, Guy N. (2014-07-01). "On Best-Possible Obfuscation" (PDF). Journal of Cryptology. 27 (3): 480–505. doi:10.1007/s00145-013-9151-z. hdl:1721.1/129413
Linear-feedback shift register (4,582 words) [view diff] exact match in snippet view article find links to article
Ciphertext-Only Cryptanalysis of GSM Encrypted Communication" (PDF), Journal of Cryptology, 21 (3): 392–429, doi:10.1007/s00145-007-9001-y, S2CID 459117, archived
Cryptography (10,733 words) [view diff] exact match in snippet view article find links to article
(1991). "Differential cryptanalysis of DES-like cryptosystems". Journal of Cryptology. 4 (1): 3–72. doi:10.1007/bf00630563. S2CID 206783462. "The Digital
Private information retrieval (2,163 words) [view diff] exact match in snippet view article find links to article
Private Information Retrieval has Linear Communication Complexity". Journal of Cryptology. 28: 161–175. arXiv:1304.5490. doi:10.1007/s00145-014-9180-2. S2CID 1450526
C. Pandu Rangan (1,223 words) [view diff] exact match in snippet view article find links to article
Asynchronous Verifiable Secret Sharing and Multiparty Computation. Journal of Cryptology Volume 28, Number 1, January 2015: Pages 49–109 (2015) Priyanka
Non-interactive zero-knowledge proof (2,636 words) [view diff] exact match in snippet view article find links to article
Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology. Vol 7(1). 1–32. 1994 (PS) Shafi Goldwasser and Yael Kalai. On the
Zero-knowledge proof (7,791 words) [view diff] exact match in snippet view article find links to article
Shamir, Adi (1988-06-01). "Zero-knowledge proofs of identity". Journal of Cryptology. 1 (2): 77–94. doi:10.1007/BF02351717. ISSN 1432-1378. S2CID 2950602
Quantum key distribution (11,612 words) [view diff] exact match in snippet view article find links to article
; Smolin, J. (1992). "Experimental Quantum Cryptography" (PDF). Journal of Cryptology. 5 (1): 3–28. doi:10.1007/bf00191318. S2CID 206771454. Brassard
Noisy-storage model (2,870 words) [view diff] exact match in snippet view article find links to article
"Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher". Journal of Cryptology. 5 (1): 53––66. doi:10.1007/bf00191321. S2CID 12079602. Cachin,
Cryptography law (3,045 words) [view diff] exact match in snippet view article find links to article
(1991). "Differential cryptanalysis of DES-like cryptosystems". Journal of Cryptology. 4 (1): 3–72. doi:10.1007/bf00630563. S2CID 206783462. "The Digital
Feedback with Carry Shift Registers (1,035 words) [view diff] exact match in snippet view article find links to article
Shift Registers, 2-Adic Span, and Combiners With Memory" (PDF). Journal of Cryptology. 10 (2): 111–147. CiteSeerX 10.1.1.37.5637. doi:10.1007/s001459900024
Relativistic quantum cryptography (2,653 words) [view diff] exact match in snippet view article find links to article
Classical Bit Commitment Using Fixed Capacity Communication Channels". Journal of Cryptology. 18 (4): 313–335. arXiv:quant-ph/9906103. doi:10.1007/s00145-005-0905-8
Oblivious RAM (3,993 words) [view diff] exact match in snippet view article find links to article
(2023), "Oblivious {RAM} with Worst-Case Logarithmic Overhead", Journal of Cryptology, Springer, p. 7, doi:10.1007/s00145-023-09447-5 Kushilevitz, Eyal;