Crypto Bibliography

Citations by First Author - G

E. Gabber, P. Gibbons, Y. Matias, and A. Mayer, How to Make Personalized Web Browsing Simple, Secure, and Anonymous, Proc. Financial Cryptography'97, Springer-Verlag LNCS 1318. [.ps.gz]

E. Gabber, P. Gibbons, D. Kristol, Y. Matias, and A. Mayer, Consistent yet Anonymous Web Access with LPWA, Communications of the ACM, February 1999. [.ps] [.ps.gz] [.ps.Z]

Z. Galil and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Journal of the ACM. Earlier version in Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS 1993). [.ps]

V. Gallo and A. Clark, Issue Authority, Second Nordic Conference on Information System Security, Stockholm, 1988. [.pdf]

J. Garay and P. MacKenzie, Abuse-free Multi-party Contract Signing, Proc. 13th International Symposium on Distributed Computing (DISC '99), Prasad Jayanti (Ed.), LNCS (1693), Springer-Verlag, pp. 151-165, Bratislava, September 1999. [.ps]

J. Garay, R. Gennaro, C. Jutla, and T. Rabin, Secure Distributed Storage and Retrieval, Theoretical Computer Science. A preliminary version appeared in WDAG'97. [.ps]

J. Garay, M. Jakobsson, and P. MacKenzie, Abuse-free Optimistic Contract Signing, Proc. Advances in Cryptology - CRYPTO '99, Michael Wiener (Ed.), LNCS (1666), Springer-Verlag, pp. 449-466, August 1999. [.ps]

J. Garay and Y. Moses, Fully Polynomial Byzantine Agreement for n>3t Processors in t+1 Rounds, SIAM J. of Computing, vol. 27, n. 2, 1998. [.ps]

G. Gaskell, P. Ashley, M. Vandenwauver, and J. Claessens, Intranet Security Technologies - SESAME or SSL?, Proceedings of the Australian Unix and Open Systems User Group National Conference (AUUG98), 1998, pp. 133-142. [.ps.gz]

D. Geer and D. Davis, Token-Mediated Certification and Electronic Commerce, Proc. 2nd USENIX Workshop on Electronic Commerce, (Oakland, CA, 1996), pp. 13-22. [.ps]

R. Gennaro, M. Rabin, and T. Rabin, Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography, Proceedings of the 1998 ACM Symposium on Principles of Distributed Computing. [.ps]

R. Gennaro, H. Krawczyk, and T. Rabin, RSA-Based Undeniable Signatures, Proceedings of CRYPTO'97. [.ps]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Proceedings Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, Springer-Verlag, 1999. (This version has an appendix added.) [.ps.gz]

R. Gennaro, Achieving Independence Efficiently and Securely, 1995 ACM Conference on Principles of Distributed Computing Systems (PODC95). [.ps.Z]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Proceedings of EUROCRYPT'96, Springer Verlag, LNCS 1070, pp. 354-371. [.ps]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA Functions, Proceedings of CRYPTO'96. [.ps]

R. Gennaro, D. Micciancio, and T. Rabin, An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products, Proceedings of the Fifth ACM Conference on Computer and Communications Security, 1998. [.ps]

R. Gennaro, Theory and Practice of Verifiable Secret Sharing; Ph.D. Thesis MIT EECS Department. [.ps.Z]

R. Gennaro and P. Rohatgi, How to Sign Digital Streams, Proceedings of CRYPTO'97. [.ps]

R. Gennaro and S. Micali, Verifiable Secret Sharing as Secure Computation, EUROCRYPT 1995. [.ps.Z]

E. Gerck, Overview of Certification Systems: X.509, CA, PGP and SKIP , published on the Internet by MCG 1997/98. [.pdf]

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, Protecting Data Privacy in Private Information Retrieval Schemes, STOC 98. [.ps.Z]

H. Gilbert, D. Gupta, A. Odlyzko, and J.-J. Quisquater, Attacks on Shamir's 'RSA for paranoids', Information Processing Letters (1998), to appear. [.pdf] [.ps]

D. Gillman and R. Rivest, Complete Variable-Length `FixFree' Codes; Designs, Codes, and Cryptography 5,2 (March 1995), 109--114. [.ps]

T. Gilmont, J.-D. Legat, and J.-J. Quisquater, An Architecture of Security Management Unit for Safe Hosting of Multiple Agents, International Workshop on Intelligent Communications and Multimedia Terminals (COST#254), Ljubljana, pp. 79-82, Nov. 1998. [.pdf]

T. Gilmont, J.-D. Legat, and J.-J. Quisquater, Enhancing the Security in the Memory Management Unit, Proceedings of the 25th EuroMicro Conference, Milan, Vol. I, pp. 449-456, Sept. 1999. [.pdf]

V. Gligor, R. Kailar, S. Stubblebine, and L. Gong, Logics for Cryptographic Protocols -- Virtues and Limitations, Proceedings of the IEEE Computer Security Foundations Workshop IV, Franconia, New Hampshire, June, 1991, pp. 219-226. [.ps.gz]

I. Goldberg and D. Wagner, TAZ Servers and the Rewebber Network: Enabling Anonymous Publishing on the World Wide Web, First Monday vol 3 no 4, 1998.

I. Goldberg, D. Wagner, R. Thomas, and E. Brewer, A secure environment for untrusted helper applications: confining the wily hacker; 1996 USENIX Security Symposium. [.pdf]

I. Goldberg and D. Wagner, Randomness and the Netscape Browser, Dr. Dobb's Journal, January 1996.

I. Goldberg, D. Wagner, and E. Brewer, Privacy-enhancing technologies for the Internet, IEEE COMPCON '97, February 1997.

O. Goldreich, Randomness, Interaction, Proofs and Zero-Knowledge (a survey); 1987. [.ps]
See a revised version of the part on Computational Randomness; 1987 (rev. 1997). [.ps]

O. Goldreich and H. Krawczyk, On the Composition of Zero-Knowledge Proof Systems; revised 1994. [.ps]

O. Goldreich, L. Levin, and N. Nisan, On Constructing 1-1 One-Way Functions; June 1995. [.ps]

O. Goldreich and A. Wigderson, Tiny Families of Functions with Random Properties:A Quality-Size Trade-off for Hashing; revised January 1996. [.ps]

O. Goldreich and E. Petrank, Quantifying Knowledge Complexity; revised July 1996. [.ps]

O. Goldreich and E. Petrank, The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols; October 1990. [.ps]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop; Theory of Cryptography Library 97-12, September 1997.

O. Goldreich and M. Sudan, Computational Indistinguishability: A Sample Hierarchy; March 1998. [.ps]

O. Goldreich and S. Safra, A Combinatorial Consistency Lemma with application to the PCP Theorem; 1996. [.ps]

O. Goldreich, A. Herzberg, and A. Segall, A Quantitative Approach to Dynamic Networks; 1992. [.ps]

O. Goldreich and S. Goldwasser, On the Limits of Non-Approximability of Lattice Problems; Sept. 1997. [.ps]

O. Goldreich, The Graph Clustering Problem has a Perfect Zero-Knowledge Proof; October 1996. [.ps]

O. Goldreich, Probabilistic Proof Systems (survey), 1995. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem, Proceedings of Crypto '97.

O. Goldreich, R. Rubinfeld, and M. Sudan, Learning polynomials with queries: the highly noisy case; FOCS95 version. [.ps]

O. Goldreich and E. Kushilevitz, A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm, J. Cryptology 6(2), 1993, pp. 97-116. Early version: Crypto 88. [.ps.Z]

O. Goldreich, Three XOR-Lemmas - An Exposition; July 1991. [.ps]

O. Goldreich and R. Vainish, How to Solve any Protocol Problem - An Efficiency Improvement; 1987. [.ps]

O. Goldreich and B. Meyer, Computational Indistinguishability -- Algorithms vs. Circuits; December 1996. [.ps]

O. Goldreich and A. Kahan, How to Construct Constant-Round Zero-Knowledge Proof Systems for NP; March 1996. [.ps]

O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness; August 1990. [.ps]

O. Goldreich, S. Goldwasser, and N. Linial, Fault-tolerant Computation in the Full Information Model; revised October 1995. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, and Public-Key Cryptosystems from Lattice Reduction Problems, CRYPTO '97.

O. Goldreich, S. Goldwasser, and S. Halevi, Collision-Free Hashing from Lattice Problems; Available as Theory of Cryptography Library: Record 96-09. [.ps]

O. Goldreich and D. Ron, A Universal Learning Algorithm; June 1996. [.ps]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation; September 1997. [.ps]

O. Goldreich, N. Nisan, and A. Wigderson, On Yao's XOR-Lemma; March 1995. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Public-key Cryptosystems from Lattice Problems, Proceedings of CRYPTO'97.

O. Goldreich and D. Ron, A Sublinear Bipartite Tester for Bounded Degree Graphs; 1997. [.ps]

O. Goldreich, S. Goldwasser, and D. Ron, Property Testing and its connection to Learning and Approximation; 1996.

O. Goldreich, A Computational Perspective on Sampling (survey); May 1997. [.ps]

O. Goldreich, A Note on Computational Indistinguishability; 1989. [.ps]

O. Goldreich, A. Sahai, and S. Vadhan, Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge; 1998. [.ps]

O. Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge; July 1991. [.ps]

O. Goldreich and S. Micali, Increasing the Expansion of Pseudorandom Generators; 1984. [.ps]

O. Goldreich and D. Ron, Property Testing in Bounded-Degree Graphs; 1997. [.ps]

O. Goldreich and A. Wigderson, On the Circuit Complexity of Perfect Hashing; July 1996. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Using Lattice Problems in Cryptography.

O. Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme; 1986. [.ps]

O. Goldreich and D. Zuckerman, Another proof that BPP subseteq PH (and more); September 1997. [.ps]

O. Goldreich, R. Ostrovsky, and E. Petrank, Computational Complexity and Knowledge Complexity; revised March 1995. [.ps]

O. Goldreich and R. Ostrovsky, Software Protection and Simulation on Oblivious RAMs; revised October 1995. [.ps]

O. Goldreich, S. Goldwasser, and D. Ron, A Note on Testing Monotinicity; 1997. [.ps]

O. Goldreich, Combinatorial Property Testing -- A Survey; 1997. [.ps]

O. Goldreich, The Foundations of Cryptography -- An Essay; June 1997.

S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks; SIAM J. Computing 17,2 (April 1988), 281--308. [.pdf]
(Note.) [.txt]

L. Gong, Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations, Distributed Computing, 9(3):131--145, 1995. Springer-Verlag. [.ps.gz]

L. Gong, Lower Bounds on Messages and Rounds for Network Authentication Protocols, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, November, 1993, pp.26-37. [.ps.gz]

L. Gong, Increasing Availability and Security of an Authentication Service, IEEE Journal on Selected Areas in Communications, Vol.11, No.5, June, 1993, pp.657-662. [.ps.gz]

L. Gong, New Security Architectural Directions for Java (Extended Abstract), Proceedings of IEEE COMPCON, San Jose, California, February 1997, pp.97--102. [.ps.gz]

L. Gong, Enclaves: Enabling Secure Collaboration over the Internet, IEEE Journal on Selected Areas in Communications, 15(3):567--575, April 1997. [.ps.gz]

L. Gong and X. Qian, The Complexity and Composability of Secure Interoperation, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, May 1994, pp.190-200.

L. Gong, Handling Infeasible Specifications of Cryptographic Protocols, Proceedings of the IEEE Computer Security Foundations Workshop IV, Franconia, New Hampshire, June, 1991, pp. 99-102. [.ps.gz]

L. Gong, T. Lomas, R. Needham, and J. Saltzer, Protecting Poorly Chosen Secrets from Guessing Attacks, IEEE Journal on Selected Areas in Communications, Vol.11, No.5, June, 1993, pp.648-656. [.ps.gz]

L. Gong and R. Schemers, Signing, Sealing, and Guarding Java Objects, Lecture Notes in Computer Science (LNCS), Vol.1419, Springer-Verlag, June 1998. [.ps.gz]

L. Gong, M. Mueller, H. Prafullchandra, and R. Schemers, Going Beyond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2, Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, California, December 1997, pp. 103-112. [.ps.gz]

L. Gong and X. Qian, Enriching the Expressive Power of Security Labels, IEEE Transactions on Knowledge and Data Engineering, 7(5):839--841, October 1995.

L. Gong, Using One-Way Functions for Authentication, ACM Computer Communication Review, Vol.19, No.5, October, 1989, pp. 8-11. [.ps.gz]

L. Gong, Variations on the Themes of Message Freshness and Replay, Proceedings of the IEEE Computer Security Foundations Workshop VI, Franconia, New Hampshire, June, 1993, pp.131-136. [.ps.gz]

L. Gong, R. Needham, and R. Yahalom, Reasoning about Belief in Cryptographic Protocols, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, May, 1990, pp. 234-248. [.ps.gz]

L. Gong, P. Syverson, Fail-Stop Protocols: An Approach to Designing Secure Protocols, Proceedings of the 5th IFIP Working Conference on Dependable Computing for Critical Applications, Urbana-Champaign, Illinois, September 1995. [.ps.gz]

L. Gong, New Protocols for Third-Party-Based Authentication and Secure Broadcast, Proceedings of the 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, November, 1994, pp.176-183.

L. Gong and N. Shacham, Elements of Trusted Multicasting, Proceedings of the IEEE International Conference on Network Protocols, Boston, Massachusetts, October, 1994, pp.23-30.

L. Gong, A Security Risk of Depending on Synchronized Clocks, ACM Operating Systems Review, Vol.26, No.1, January, 1992, pp.49-53. [.ps.gz]

L. Gong, A Secure Identity-Based Capability System, Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, May, 1989, pp.56-63. [.ps.gz]

L. Gong, N. Shacham, Multicast Security and Its Extension to a Mobile Environment, ACM-Baltzer Journal of Wireless Networks, 1(3):281--295, October 1995. [.ps.gz]

L. Gong, A Note on Redundancy in Encrypted Messages, ACM Computer Communication Review, Vol.20, No.5, October, 1990, pp. 18-22. [.ps.gz]

L. Gong, Collisionful Keyed Hash Functions with Selectable Collisions, Information Processing Letters, 55(3):167--170, August 1995. Elsevier Science B.V.

L. Gong, P. Lincoln, and J. Rushby, Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid Faults, Proceedings of the 5th IFIP Working Conference on Dependable Computing for Critical Applications, Urbana-Champaign, Illinois, September 1995.

L. Gong and X. Qian, Computational Issues in Secure Interoperation, IEEE Transactions on Software Engineering, 22(1):43--52, January, 1996. [.ps.gz]

L. Gong, Optimal Authentication Protocols Resistant to Password Guessing Attacks, Proceedings of the 8th IEEE Computer Security Foundations Workshop, County Kerry, Ireland, June 1995, pp. 24-29. [.ps.gz]

L. Gong and D. Wheeler, A Matrix Key Distribution Scheme. Journal of Cryptology, Vol.2, No.2, Springer-Verlag, New York, 1990, pp.51-59. [.ps.gz]

K. Gopalakrishnan and D. Stinson, A simple analysis of the error probability of two-point based sampling; Information Processing Letters 60 (1996), 91-96. [.ps]

K. Gopalakrishnan and D. Stinson, A short proof of the non-existence of certain cryptographic functions; J. Combin. Math. Combin. Comput. 20 (1996), 129-137. [.ps]

J. Gray and J. McLean, Using Temporal Logic to Specify and Verify Cryptographic Protocols (Progress Report), Proceedings of the 8th IEEE Computer Security Foundations Workshop, IEEE Press, 1995. [.pdf] [.ps]

Schneier.com is a personal website. Opinions expressed are not necessarily those of BT Counterpane.