Search for Topics All Reviews
	Browse All Reviews > Data (E) > Data Encryption (E.3) > Public Key Cryptosystems (E.3...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 100 Reviews about "Public Key Cryptosystems (E.3...)": Date Reviewed   A multidisciplinary introduction to information security Mjølsnes S.,  Chapman&Hall/CRC, Boca Raton, FL, 2011. 348 pp. Type: Book (978-1-420085-90-7) Nowadays, the study of information security involves being aware of a broad range of domains, including mathematics, computer science, telecommunications, and social sciences. Information security focuses on how the information processed in... Apr 4 2012   Quantum private communication Zeng G.,  Springer Publishing Company, Incorporated, New York, NY, 2010. 380 pp. Type: Book (978-3-642032-95-0) The need for secure and private communication has existed since the Roman Empire. There are three elements to this: to protect the content of a message from agents who should not see it, to verify that content received is unchanged from when it... May 27 2011   Computing arbitrary functions of encrypted data Gentry C.  Communications of the ACM 53(3): 97-105, 2010. Type: Article Is it possible to delegate the ability to process your data without giving away access to it?... May 26 2011   Ad hoc broadcast encryption Wu Q., Qin B., Zhang L., Domingo-Ferrer J.  CCS 2010 (Proceedings of the 17th ACM Conference on Computer and Communications Security, Chicago, IL,  Oct 4-8, 2010) 741-743, 2010. Type: Proceedings Wu et al. propose a new network primitive for the ad hoc broadcast encryption (AHBE) of message session keys in applications without a trusted dealer. They create an AHBE system as a key encapsulation method that contains probabilistic algorithms ... Feb 1 2011   Gröbner bases for public key cryptography Caboara M., Caruso F., Traverso C.  Symbolic and algebraic computation (Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria,  Jul 20-23, 2008) 315-324, 2008. Type: Proceedings, Reviews: (2 of 2) The pseudonymous authors of an earlier paper [1] purport to show “why you cannot even hope to use Gröbner bases in cryptography,” although what they show, in fact, is that a particular scheme, often referred to as Polly Cracker,... Nov 27 2008   Gröbner bases for public key cryptography Caboara M., Caruso F., Traverso C.  Symbolic and algebraic computation (Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria,  Jul 20-23, 2008) 315-324, 2008. Type: Proceedings, Reviews: (1 of 2) The computation of Gröbner bases is a difficult task often encountered in cryptanalysis, the destructive aspect of cryptology. As a general rule, such difficult tasks can be reused constructively, as foundations for new cryptosystems.... Sep 30 2008   A password-based grid security infrastructure Cai Z.  Digital society (Proceedings of the Second International Conference on Digital Society, Feb 10-15, 2008) 157-164, 2008. Type: Proceedings The open-source Globus Toolkit (GT) is used to build distributed computing systems and applications. In order to establish the identity of users and protect communications, the GT provides authentication and authorization based on the standard... Sep 9 2008    Public key superstructure: "It’s PKI Jim, but not as we know it!" Wilson S.  Identity and trust on the Internet (Proceedings of the 7th Symposium on Identity and Trust on the Internet, Gaithersburg, Maryland,  Mar 4-6, 2008) 72-88, 2008. Type: Proceedings Why is it so hard to make global public key infrastructure (PKI) work? Not only does Wilson excellently question the misleading assumptions pertaining to the apparent failure of universal open PKI, but he also lucidly presents a viable evolution... Sep 2 2008   Split-ballot voting: everlasting privacy with distributed trust Moran T., Naor M.  Computer and communications security (Proceedings of the 14th ACM Conference on Computer and Communications Security, Alexandria, Virginia,  Oct 28-31, 2007) 246-255, 2007. Type: Proceedings A universally verifiable voting protocol, which can be performed by unaided humans and distributed trust across more than one voting authority, is presented in this paper. It combines both physical and cryptographical requirements.... May 14 2008   Quantum communication and information processing with quantum dots Yamamoto Y.  Quantum Information Processing 5(5): 299-311, 2006. Type: Article Many photonic quantum information processing techniques, such as quantum teleportation, quantum repeaters, and linear optics quantum computers, require a large number of single photons at definite time instances. Two methods for producing single... Sep 13 2007       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc. Terms of Use | Privacy Policy