Hellman - PDFSEARCH.IO - Document Search Engine

Hellman
Results: 440

#	Item
71	One-Round Secure Computation and Secure Autonomous Mobile Agents (Extended Abstract) Christian Cachin1 , Jan Camenisch1 , Joe Kilian2 , and Joy M¨ uller1 Abstract. This paper investigates one-round secure computation be Add to Reading List Source URL: www.zurich.ibm.com Language: English - Date: 2000-04-12 11:39:28 XTR Secure multi-party computation Alice and Bob Diffie–Hellman key exchange Public-key cryptography PP X Window System Commitment scheme Cryptography Cryptographic protocols Oblivious transfer
72	DOC Document Add to Reading List Source URL: www.vti.se Language: English Svalbard Hellman
73	Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups Patrick P. C. Lee Department of Computer Science & Engineering The Chinese University of Hong Kong Add to Reading List Source URL: www.cs.cuhk.hk Language: English - Date: 2004-06-11 06:27:45 Locksmithing Rekeying R-tree B-tree Key distribution Diffie–Hellman key exchange Public-key cryptography Self-balancing binary search tree Tree Cryptography Cryptographic protocols Binary trees
74	Pairing-Based Onion Routing with Improved Forward Secrecy ANIKET KATE, GREG M. ZAVERUCHA, and IAN GOLDBERG University of Waterloo This article presents new protocols for onion routing anonymity networks. We define a pro Add to Reading List Source URL: www.cypherpunks.ca Language: English - Date: 2010-12-30 09:39:44 Cryptographic software Boneh/Franklin scheme Finite fields Tor Onion routing XTR Diffie–Hellman key exchange Public-key cryptography Pairing Cryptography Internet privacy Cryptographic protocols
75	Implementation of Group Member Authentication Protocol in Mobile Ad-hoc Networks Hitoshi Asaeda∗ , Musfiq Rahman† , Mohammad Hossein Manshaei‡ , Yasuko Fukuzawa§ University, Graduate School of Media and Governance Add to Reading List Source URL: web.sfc.wide.ad.jp Language: English - Date: 2006-01-24 03:14:56 Key management Electronic commerce Verifiable secret sharing Key distribution Interactive proof system Diffie–Hellman key exchange Authentication Secret sharing Computer network Cryptography Cryptographic protocols Public-key cryptography
76	Noname manuscript No. (will be inserted by the editor) Generalizing Cryptosystems Based on the Subset Sum Problem Aniket Kate · Ian Goldberg Add to Reading List Source URL: www.cypherpunks.ca Language: English - Date: 2011-05-05 15:39:42 Security Paillier cryptosystem Merkle–Hellman knapsack cryptosystem Niederreiter cryptosystem Cryptography Post-quantum cryptography Cryptosystem RSA Semantic security Public-key cryptography Cyberwarfare Applied mathematics
77	Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, France Add to Reading List Source URL: book.huihoo.com Language: English - Date: 2006-07-27 09:21:33 Cryptographic protocols Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange XTR Discrete logarithm ElGamal encryption Subliminal channels RSA Cryptography Computational hardness assumptions Finite fields
78	Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice David Adrian¶ Karthikeyan Bhargavan∗ Zakir Durumeric¶ Pierrick Gaudry† Matthew Green§ J. Alex Halderman¶ Nadia Heninger‡ Drew Springall¶ Emmanuel Add to Reading List Source URL: weakdh.org Language: English - Date: 2015-05-22 22:25:48 Finite fields Computational hardness assumptions Group theory Diffie–Hellman key exchange XTR Secure Shell Cipher suite Index calculus algorithm Elliptic curve Diffie–Hellman Cryptography Abstract algebra Cryptographic protocols
79	Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE Add to Reading List Source URL: certicrypt.gforge.inria.fr Language: English - Date: 2013-06-17 13:32:36 ElGamal encryption Public-key cryptography Ciphertext indistinguishability Diffie–Hellman problem Decisional Diffie–Hellman assumption Optimal asymmetric encryption padding Cramer–Shoup cryptosystem Cryptography Computational hardness assumptions Finite fields
80	This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followi Add to Reading List Source URL: cacr.uwaterloo.ca Language: English - Date: 2011-07-10 02:35:13 FEAL Lecture Notes in Computer Science International Cryptology Conference Computational hardness assumptions Cryptographic protocols Diffie–Hellman problem Index of cryptography articles Cryptography LOKI Data Encryption Standard

UPDATE