Micciancio, D. and Goldwasser, S.
*Complexity of Lattice Problems: A Cryptographic Perspective.* The
Kluwer International Series in Engineering and Computer Science,
Kluwer Academic Publishers, March 2002. Details

Goldwasser, S. and Bellare, M. *Lecture Notes on
Cryptography.*
Summer course on cryptography, MIT, 1996-2001. Details

Goldwasser, S. (Ed.). *Advances in Cryptology: Proceedings of
Crypto'88, 8th Annual International Cryptology Conference, Santa
Barbara, California, August 1988,*, volume 403 of *Lecture Notes in Computer Science*, Springer, February 1990.

Goldwasser, S. and Micali, S. **Probabilistic Encryption**.
Special issue of *Journal of Computer and Systems Sciences*,
Vol. 28, No. 2, pages 270-299, April 1984. .pdf

Goldreich, O., Goldwasser, S., and Micali S. **How to Construct
Random Functions**. *Journal of the ACM*, vol. 33, no. 4,
pages 792-807, October 1986. .pdf

Goldwasser, S. and Sipser, M. **Private Coins versus Public Coins
in Interactive Proof Systems.** *Randomness
and Computation*, vol. 5 of *Advances in Computing Research*,
JAI Press, 1989.

Goldwasser, S., Micali S., and Rivest, R. **A Digital
Signature Scheme Secure Against Adaptive Chosen-Message Attack**.
*SIAM J. of Computing*, vol. 17, no. 2, pages 281-308, April 1988.

Aiello, B., Goldwasser S., and Hastad, J. **On the Power of
Interaction**. *Combinatorica,* volume 10, no. 1, pages 3-25, 1990.

Goldwasser, S., Micali S., and Rackoff, C. **The Knowledge Complexity
of Interactive Proof Systems**.
*SIAM J. of Computing*, vol. 18, no. 1, pages 186-208, January
1989. .pdf

Goldwasser, S. **Interactive Proof Systems**. *Computational
Complexity Theory*. J. Hartmanis (Ed.), Proceedings of Symposia in
Applied Mathematics, vol. 38, pages 108-128, 1989.

Goldwasser, S. **The Search for Provably Secure Cryptosystem**.
In C. Pomerance, editor, *Cryptography and Computational Number Theory,
Proceedings of Symposia in Applied Mathematics*, vol. 42, pages 89-113, American Mathematical Society, 1990.

Bellare M., Goldreich, O., and Goldwasser S. **Randmoness in
Interactive Proofs**. *Computational
Complexity*, vol. 4, no. 4, pages 319-354, 1993.

Bellare, M. and Goldwasser, S. **The Complexity of Decision versus
Search**. * SIAM Journal of Computing*. vol 23., no. 1,
p. 97-119, February 1994. .ps

Feige, U., Goldwasser, S., Lovasz, L., Safra, S., and Szegedi, M.
**Interactive Proofs and the Hardness of Approximating Cliques**.
*Journal of the ACM*, vol. 43, no 2., pages 268-292, 1996. .pdf

Goldreich, O., and Goldwasser S., and Linial N. **Fault Tolerant
Computation in the Full Information Model.** * SIAM Journal of
Computing*, vol. 27, no. 2, pages 506-544, April 1998. .pdf

Golderich, O., Goldwasser S., and Ron D. **Property Testing and Its
Connection to Learning and Approximation.** * Journal of the
ACM*, vol. 45, no. 4, pages 653-750, July 1998. .pdf

Goldwasser, S. and Kilian J. **Primality Testing based on Elliptic
Curves. ** * Journal of the ACM*,
vol. 46, no. 4, pages 450-472, July 1999. .pdf

Golderich, O. and Goldwasser S. **On the Limits of
Non-Approximability of Lattice Problems.** *Journal of Computer
and System Sciences*, vol. 60, no. 3, pages 540-563, June 2000. .pdf

Golderich, O., Goldwasser S., Lehman E., Ron D., and Samorodnitsky A.
**Testing Monotonicity**.
* Combinatorica*, vol. 20, no. 3, pages 301-337, 2000. .pdf

Shafi Goldwasser and Yehuda Lindell. **Secure Multi-Party
Computation without Agreement.** *J. Cryptology*,
18(3):247-287, 2005.

Oded Goldreich, Shafi Goldwasser, and Asaf Nussboim. **On the Implementation of Huge Random Objects**. *SIAM J. Computing* 39(4):2761-2822, 2010.

Goldwasser, S. and Micali, S. **Probabilistic Encryption and How to
Play Mental Poker Hiding All Partial Information**. *Proceedings
of the 14th Annual ACM Symposium on the Theory of Computing*, San
Francisco California, pages 365-377, May 1982. .pdf

Goldwasser, S., Micali, S., and Tong, P.
**Why and How to Establish a Private Code on a Public Network**. *
Proceedings of the 23rd Annual Symposium on Foundations of Computer
Science (FOCS'82)*, Chicago, Illinois, pages 134-144, October 1982.

Goldwasser, S., Micali, S., and Yao, A.
**Strong Signature Schemes**. * Proceedings of the 15th Annual ACM Symposium on
Theory of Computing*, Boston Massachusetts, pages 431-439, April
1983. .pdf
Preliminary version by the same authors appeared in *Advances
in Cryptology: Proceeding of Crypto 82*, Chaum, D. R. L. Rivest and
A. T. Sherman eds., Plenlum Press, pages 211-215, 1983.

Goldreich, O., Goldwasser, S., and Micali, S. **How to Construct
Random Functions**. * Proceedings of the 25th Annual Symposium
on Foundations of Computer Science (FOCS'84),* West Palm Beach
Florida, pages 464-480, October 1984. .pdf

Goldwasser, S., Micali, S., and Rivest, R. **A Paradoxical Solution
to the Signature Problem**. *Proceedings of the 25th Annual
Symposium on Foundations of Computer Science (FOCS'84),* West Palm
Beach Florida, pages 441-449, October 1984. .pdf

Blum, M. and Goldwasser, S. **An Efficient Probabilistic
Public-Key Encryption Scheme which Hides All Partial
Information**. In G.R. Blakely and David Chaum, editors,
* Advances in Cryptology: Proceedings of CRYPTO 84, Santa Barbara,
CA, August 1984*, volume 196 of *Lecture Notes in Computer Science*, pages 289-302, Springer, 1985.

Goldreich O., Goldwasser, S., and Micali, S. **On the Cryptographic
Applications of Random Functions**. In G.R. Blakely and David
Chaum, editors, *Advances in Cryptology: Proceedings of CRYPTO'84,
Santa Barbara, CA, August 1984*, volume 196 of *Lecture Notes
in Computer Science*, pages 276-288, Springer, 1985. .pdf

Goldwasser, S., Micali, S., and Rackoff, C. **The Knowledge
Complexity of Interactive Proof Systems.** * Proceedings of the
17th Annual ACM Symposium on Theory of Computing (STOC'85)*, Providence
Rhode Island, pages 291-304, May 1985. .pdf

Chor, B., Goldwasser S., Micali S., Awerbuch B. **Verifiable Secret
Sharing and Achieving Simultaneity in the Presence of Faults**.
* Proceedings of the 26th Annual Symposium on the Foundations of
Computer Science (FOCS'85),* pages 383-395, October 1985.

Chor, B., Goldreich O., and Goldwasser S. **The Bit Security of
Modular Squaring Given Partial Factorization of the Modulos.** In
Hugh C. Williams, editor, *Advances in Cryptology - Crypto 85,
Santa Barbara, CA, August 1985, *volume 218 of *Lecture Notes in
Computer Science*, pages 448-457, Springer, 1986. .pdf

Goldwasser, S. and Sipser, M. **Private Coins versus Public Coins
in Interactive Proof Systems**.
* Proceedings of the 18th Annual ACM Symposium on Theory of
Computing (STOC'86),* Berkeley CA, May, pages 59-86, 1986. .pdf

Goldwasser, S. and Kilian, J. **Almost All Primes Can be Quickly
Certified**. *Proceedings of the 18th Annual ACM Symposium on
the Theory of Computing (STOC'86),* Berkeley, CA, pages 315-329,
May 1986. .pdf

Aiello, B., Goldwasser S., and Hastad, J. **On the Power of
Interaction. *** Proceedings of the 27th Annual Symposium on the
Foundations of Computer Science (FOCS'86),*Toronto, Canada,
pages 368-379, October 1986.

Ben-Or, M., Goldwasser S., Kilian J., and Wigderson A. **Multi-Prover
Interactive Proofs: How to Remove Intractability Assumptions**.
* Proceedings of the 20th Annual ACM Symposium on Theory of
Computing (STOC'88),*Chicago, Illinois, pages 113-122, May 1988. .pdf

Ben-Or, M., Goldwasser S., and Wigderson A. **Completeness Theorems
for Non-Cryptographic Fault Tolerant Distributed Computation** *
Proceedings of the 20th Annual ACM Symposium on Theory of
Computing (STOC'88),* Chicago, Illinois, pages 1-10, May 1988. Invited to
special issue of *Journal of Computer Science and Systems.* .pdf

Ben-Or, M., Goldreich, O., Goldwasser, S., Hastad, J., Kilian, J.,
Micali, S. and Rogaway, P. **Everything Provable is Provable in
Zero Knowledge**. In S. Goldwasser, editor, *Advances in
Cryptology: Proceedings of CRYPTO'88, 8th Annual International
Cryptology Conference, Santa Barbara, California, August 1988,*,
volume 403 of *Lecture Notes in Computer Science*, pages
37-56, Springer, February 1990.

Bellare, M. and Goldwasser, S. **New Paradigms for Digital
Signatures and Message Authentication Based on Non-Interactive Zero
Knowledge Proofs**. In G. Brassard, editor, * Advances in
Cryptology - CRYPTO'89, Proceedings, Santa Barbara, CA, August
1989*, volume 435 of *Lecture Notes in Computer Science*,
pages 194-211, Springer, 1990. .pdf

Beaver, D. and Goldwasser, S. **Multiparty Computation with Faulty
Majority.** In G. Brassard, editor, * Advances in Cryptology -
CRYPTO'89, Proceedings, Santa Barbara, CA, August 1989*, volume
435 of *Lecture Notes in Computer Science*, pages 589-590,
Springer, 1990. .pdf

Ben-Or, M., Goldwasser S., Kilian J., and Wigderson A. **Efficient
Identification Schemes Using Two Prover Interactive Proofs**. In
G. Brassard, editor, * Advances in Cryptology - CRYPTO'89,
Proceedings, Santa Barbara, CA, August 1989*, volume 435 of
*Lecture Notes in Computer Science*, pages 498-506, Springer,
1990. .pdf

Beaver, D., and Goldwasser, S. **Multiparty Computation with Faulty
Majority.** * Proceedings of the 30th Annual IEEE Symposium on
Foundations of Computer Science (FOCS'89),* Duke, NC, pages
468-473, IEEE, October 1989. .pdf

Bellare, M., Cowen, L., and Goldwasser S. **On the Structure of
Secret Key Exchange Protocols**. In J. Feigenbaum, Michael
Merritt, editors, *Distributed Computing and Cryptography,
Proceedings of a DIMACS Workshop (Dimacs series in Discrete
Mathematics and Theoretical Computer Science)*, October, 1989,

Bellare, M., Goldreich, O., and Goldwasser S. **Randomness
in Interactive Proofs**. *Proceedings of the 31st Annual
Symposium on Foundations of Computer Science (FOCS'90)*,
St. Louis, MS, pages 563-573, IEEE, May 1990. .pdf

Goldwasser, S. and Levin L. **Fair Computation of
General Functions in Presence of Immoral Majority**. In
A. J. Menezes and S. A. Vanstone, editors *Advances in Cryptology -
Crypto'90, Proceedings,* in volume 537 of *Lecture Notes in
Computer Science*, pages 77-93, Springer, 1991. .pdf

Goldwasser, S. **Interactive Proofs and Applications**.
In Ichiro, Satake, editor, *Proceedings of the International
Congress of Mathematicians, 1990 (ICM'90)*volume 2, Springer-Verlag, 1991.

Feige, U., Goldwasser S., Lovasz L., Szegedi M., and Safra S.
**Approximating the Clique is Almost NP-Complete**.
*Proceedings of the 32nd Annual Symposium on Foundations of
Computer Science (FOCS'91),*, San Juan, Puerto Rico, pages 2-12,
IEEE, October 1991. .pdf

Beigel, R., Bellare, M., Feigenbaum, J., and Goldwasser, S.
**Languages That Are Faster Than Their Proofs** *Proceedings of the 32nd Annual Symposium on Foundations of
Computer Science (FOCS'91),*, San Juan, Puerto Rico, pages 19-28,
IEEE, October 1991. .pdf

Goldreich, O., Goldwasser S., Linial N.
**Fault Tolerant Computation in the Full Information Model**. *Proceedings of the 32nd Annual Symposium on Foundations of
Computer Science (FOCS'91),*, San Juan, Puerto Rico, pages 447-457,
IEEE, October 1991. .pdf

Goldwasser, S., Ostrovsky, R. **Invariant Signatures and
Non-interactive Zero-Knowledge Proofs are Equivalent** In Ernest
F. Brickell, editor, *Advances in Cryptology - CRYPTO'92,
Proceedings of the 12th Annual International Cryptology Conference,
Santa Barbara, CA, August 1992,*, in volume 740 of *Lecture
Notes in Computer Science*, pages 228-245, Springer, 1993. .pdf

Bellare, M., Goldwasser S., Carsten L., and Russel A.
**Efficient Probabilistically Checkable Proofs and Applications to
Approximation**. *Proceedings of the Twenty-Fifth Annual ACM
Symposium on Theory of Computing (STOC'93)*, San Diego, CA, pages
294-304, May 1993. .ps

Bellare, M., Goldreich O., Goldwasser S. **Incremental
Cryptography: the Case of Hashing and Signing**. In Yvo Desmedt,
editor, *Advances in Cryptology - CRYPTO'94, 14th Annual
International Cryptology Conference, Santa Barbara, CA, August
1994,* volume 839 of *Lecture Notes in Computer Science*,
pages 216-233, Springer, 1994. .pdf

Bellare, M., Goldreich O., Goldwasser S. **Incremental Cryptography
and Application to Virus Protection**. * Proceedings of the
Twenty-Seventh Annual ACM Symposium on Theory of Computing
(STOC'95)*, Las Vegas, NV, pages 45-56, May 1995. .pdf

Goldreich O., Goldwasser S., and Ron D. **Property Testing and its
Connections to Learning and Approximation**. In * Proceedings of
the 37th Annual IEEE Symposium on Foundations of Computer Science
(FOCS'96)*, Burlington, VT, pages 339-348, October 1996. Final
version Accepted to the *Journal of the ACM*. .pdf

Bellare, M. and Goldwasser, S. **Verifiable partial key
escrow. ** * Proceedings of the 4th ACM Conference on Computer &
Communications Security (CCS'97),* Zurich, Switzerland, pages
78-91, April 1997. Also, Technical Report number CS95-447, Dept of CS
and Engineering, UCSD, October 1995. .pdf

Goldreich, O., Goldwasser, S., and Halevi, S. **Eliminating
Decryption Errors in the Ajtai-Dwork Cryptosystem**. In B. Kaliski,
Jr., editor, *Advances in Cryptology - CRYPTO'97, Proceedings of
the 17th Annual International Cryptology Conference, Santa Barbara,
CA, August, 1997*, volume 1294 of *Lecture Notes in Computer
Science*, pages 105-111, Springer, 1997. .pdf

Goldreich, O., Goldwasser, S., and Halevi, S. **Public-Key
Cryptosystems from Lattice Reduction Problems**. In B. Kaliski,
Jr., editor, *Advances in Cryptology - CRYPTO'97, Proceedings of
the 17th Annual International Cryptology Conference, Santa Barbara,
CA, August, 1997*, volume 1294 of *Lecture Notes in Computer
Science*, pages 112-131, Springer, 1997. .pdf

Bellare, M., Goldwasser S., and Micciancio, D. **"Pseudo-Random"
Number Generation within Cryptographic Algorithms: The DDS Case.**
In B. Kaliski, Jr., editor, *Advances in Cryptology - CRYPTO'97,
Proceedings of the 17th Annual International Cryptology Conference,
Santa Barbara, CA, August, 1997*, volume 1294 of *Lecture Notes
in Computer Science*, pages 277-291, Springer, 1997. .pdf

Goldwasser, S. **Multi-Party Computations: Past and Present.**
Invited paper to the *Proceedings of the Sixteenth Annual ACM
Symposium on Principles of Distributed Computing (PODC'97)*,
Santa Barbara, CA, pages 1-6, August, 1997. .pdf

Goldwasser, S. **New Directions in Cryptography: Twenty Some Years
Later (or Cryptography and Complexity: A Match Made in Heaven).**
Invited paper to the *Proceedings of the 38th Annual IEEE
Symposium on Foundations of Computer Science, (FOCS '97)*, Miami
Beach, Florida, pages 314-324, October 1997. .pdf

Goldreich, O. and Goldwasser, S. **On the Limits of
Non-Approximability of Lattice Problems.** In *Proceedings of
the 30th Annual ACM Symposium on Theory of Computing (STOC)*,
Dallas, TX, pages 1-9, May 1998. .pdf
Invited to Special Issue of
*JCSS.*

Goldreich, O., Goldwasser, S., Lehman, E., and Ron, D. **Testing
Monotonicity**. In *Proceedings of the 39th IEEE Annual
Symposium on Foundations of Computer Science (FOCS'98)*, Palo Alto, CA,
pages 426-435, October 1998. .pdf

Gertner Y., Goldwasser S., and Malkin T. **A Random Server Model for
Private Information Retrieval (or How to Achieve Information Theoretic
PIR Avoiding Database Replication).**. In M. Luby, J. D. P. Rolim,
and M. Serna, editors, *Randomization and Approximation Techniques
in Computer Science, Second International Workshop, RANDOM'98,
Barcelona, Spain, October 1998*, volume 1518 of *Lecture Notes
in Computer Science*, pages 200-217, Springer, 1998..pdf

Canetti R. and Goldwasser S. **An Efficient Threshold Public-key
Cryptosystem Secure Against Adaptively Chosen Ciphertext Attack.**
In J. Stern, editor, *Advances in Cryptology - EUROCRYPT '99,
International Conference on the Theory and Application of
Cryptographic Techniques*, Prague, Czech Republic, May, 1999,
volume 1592 of *Lecture Notes in Computer Science*, pages
90-106, Springer, 1999.

Canetti, R., Goldreich, O., Goldwasser, S., and Micali,
S. **Resettable Zero Knowledge.** *Proceedings of the 32nd
Annual ACM Symposium on Theory of Computing (STOC'00)*, pages
235-244, Portland, Oregon, May 2000. .pdf

Bellare, M., Fischlin, M., Goldwasser, S., and Micali, S.
**Identification Protocols Secure Against Reset Attacks.**. In
B. Pfitzmann, editor, *Advances in Cryptology - Eurocrypt 2001,
International Conference on the Theory and Application of
Cryptographic Techniques, Innsbruck, Austria, May, 2001*, volume
2045 of *Lecture Notes in Computer Science*, pages 495-511,
Springer, 2001. .pdf

Barak, B., Goldreich, O., Goldwasser, S., and Lindell, Y.
**Resettably-Sound Zero-Knowledge and its Applications. **
*Proceedings of the 42nd Annual Symposium on Foundations of
Computer Science (FOCS'01)*, pages 116-125, Las Vegas, Nevada,
October 2001. .pdf

Goldwasser S. and Lindell, Y. **Multi Party Computation without
Broadcast.** In *Proceedings of DIMACS Workshop on Cryptographic
Protocols in Complex Environments*, Rutgers University,
Piscataway, NJ, May, 2002.

Goldwasser S. and Lindell, Y. **Secure Computation without
Agreement.** *Proceedings of the 16th Int'l Symposium on
DIStributed Computing (DISC)*, pages 17-32, Toulouse, France,
October 2002. .pdf

Akavia, A., Goldwasser, S., and Safra, Samuel. **Proving Hard-Core
Predicates Using List Decoding.** *Proceedings of the 44th Annual IEEE Symposium on
Foundations of Computer Science*, pages 146-157, Cambridge, MA,
October 2003. .pdf

Goldreich, O., Goldwasser, S., and Nussboim, A. **On the Implementation
of Huge Random Objects.** *Proceedings of the 44th Annual IEEE Symposium on
Foundations of Computer Science*, pages 68-79, Cambridge, MA,
October 2003. .pdf

Goldwasser, S. and Kalai, Y.T. **On the (in)security of the Fiat-Shamir
paradigm.** *Proceedings of the 44th Annual IEEE Symposium on
Foundations of Computer Science (FOCS 2003)*, pages 102-113, Cambridge, MA,
October 2003. .pdf

Shafi Goldwasser and Erez Waisbard. **Transformation of Digital Signature
Schemes into Designated Confirmer Signature Schemes.** *First Theory of
Cryptography Conference (TCC 2004)*, Cambridge, MA, pages 77-100 ,
February 2004.

Shafi Goldwasser and Yael Tauman Kalai. **On the Impossibility of
Obfuscation with Auxiliary Input.** *Proceedings of the 46th
Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005)*,
Pittsburgh, PA, pages 553-562, October 2005.

Shafi Goldwasser and Dmitriy Kharchenko. **Proof of Plaintext Knowledge for
the Ajtai-Dwork Cryptosystem.** *Theory of Cryptography
Conference (TCC 2005)*, Cambridge, MA, pages 529-555, February 2005.

Shafi Goldwasser, Madhu Sudan, and Vinod Vaikuntanathan. **Distributed
Computing with Imperfect Randomness.** *19th International
Symposim on Distributed Computing (DISC 2005)*, Cracow, Poland,
pages 288-302, September 2005.

Adi Akavia, Oded Goldreich, Shafi Goldwasser, and Dana Moshkovitz.
**On basing one-way functions on NP-hardness.** *Proceedings of
the 38th ACM Symposium on Theory of Computing (STOC 2006)*,
Seattle, Washington, pages 701-710, May 2006.

Shafi Goldwasser, Elan Pavlov and Vinod Vaikuntanathan.
**Fault-Tolerant Distributed Computing in Full-Information
Networks.** *Proceedings of the 47th Annual IEEE Symposium on
Foundations of Computer Science (FOCS 2006)*, Berkeley, CA,
October 2006.

Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, and Vinod Vaikuntanathan. **Secure Computation from Random Error Correcting Codes.** *EUROCRYPT 2007*, Barcelona, Spain, pages 291-310, May 2007.

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, and Guy N. Rothblum. **Verifying and decoding in constant depth.** *39th ACM Symposium on Theory of Computing (STOC 2007)*, San Diego, CA, pages 440-449, June 2007.

Shafi Goldwasser and Guy N. Rothblum. **On Best-Possible Obfuscation.** In Salil Vadhan, editor, *4th Theory of Cryptography Conference (TCC 2007), Amsterdam, The Netherlands*, volume 4392 of *Lecture Notes in Computer Science*, pages 194-213, 2007. Springer.

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, and Guy N. Rothblum. **A (de)constructive approach to program checking.** *Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008)*, Victoria, British Columbia, Canada, pages 143-152, May 2008.

Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. **Delegating computation: interactive proofs for muggles**. *Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008)*, Victoria, British Columbia, Canada, pages 113-122, May 2008.

Ran Canetti, Dror Eiger, Shafi Goldwasser, and Dah-Yoh Lim. **How to Protect Yourself without Perfect Shredding.** In L. Aceto, I. Damgard, L.A. Goldberg, M.M. Halldorsson, A. Ingolfsdottir, I. Walukiewicz, editors, *Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008*, volume 5126 of *Lecture Notes in Computer Science*, pages 511-523, 2008. Springer.

Shafi Goldwasser. **Program Obfuscation and One-Time Programs.** In Tal Malkin, editor, *Topics in Cryptology- CT-RSA 2008: The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008*, volume 4964 of *Lecture Notes in Computer Science*, pages 333-334, 2008. Springer. Invited Talk.

Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. **One-Time Programs.** In David Wagner, editor, *Advances in Cryptology - CRYPTO 2008: 28th Annual International Cryptology Conference, Santa Barbara, August 2008*, volume 5157 of * Lecture Notes in Computer Science*, pages 39-56, 2008. Springer.

Shafi Goldwasser. **Cryptography without (Hardly Any) Secrets?** In Antoine Joux, editor *Advances in Cryptology - EUROCRYPT 2009, 28th International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 2009*, volume 5479 of *Lecture Notes in Computer Science*, pages 369-370, 2009. Springer.

Shafi Goldwasser. **Athena lecture: Controlling Access to Programs?*** Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009*, Bethesda, MD, pages 167-168, May 31 - June 2, 2009.

Adi Akavia, Shafi Goldwasser, and Vinod Vaikuntanathan. **Simultaneous Hardcore Bits and Cryptography against Memory Attacks.** In Omer Reingold, editor, * Theory of Cryptography, 6th Theory of Cryptography Conference (TCC 2009), San Francisco, CA*, volume 5444 of *Lecture Notes in Computer Science*, pages 474-495, 2009. Springer.

Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, and Vinod Vaikuntanathan. **Weak Verifiable Random Functions.** In Omer Reingold, editor, * Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, March 15-17, 2009*, volume 5444 of *Lecture Notes in Computer Science*, pages 558-576, 2009. Springer

Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, and Vinod Vaikuntanathan. **Public-Key Encryption Schemes with Auxiliary Inputs.** In Daniele Micciancio, editor, *Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland*, volume 5978 of *Lecture Notes in Computer Science*, pages 361-381, 2010. Springer.

Zvika Brakerski, Shafi Goldwasser. **Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back)**. *Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA*, volume 6223 of *Lecture Notes in Computer Science*, pages 1-20, Springer, 2010.

Shafi Goldwasser, Guy N. Rothblum. **Securing Computation against Continuous Leakage.** *Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA*, volume 6223 of *Lecture Notes in Computer Science*, pages 59-79, Springer, 2010.

Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan. **Robustness of the Learning with Errors Assumption.** *Innovations in Computer Science (ICS 2010)*, Beijing, China, pages 230-240, January 2010.

Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz. **Erratum for: on basing one-way functions on NP-hardness.** *42nd ACM Symposium on Theory of Computing (STOC 2010)*, Cambridge, MA, pages 795-796, June 2010.

Elette Boyle, Shafi Goldwasser, and Yael Tauman Kalai. **Coin Tossing with Leakage.** In David Peleg, editor, *Distributed Computing: Proceedings of the 25th International Symposium on DIStributed Computing, Rome, Italy, September 20-22, 2011*, volume 6950 of *Lecture Notes in Computer Science*, pages 181-196, 2011. Springer. Also, IACR Cryptology ePrint Archive 2011: 291, 2011.

Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai. **Black-Box Circular-Secure Encryption beyond Affine Functions.** In Yuval Ishai, editor, *Theory of Cryptography - 8th Theory of Cryptography Conference (TCC 2011), Providence, RI, March 2011*, volume 6597 of *Lecture Notes in Computer Science*, pages 201-218, 2011. Springer.

Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum. **Program Obfuscation with Leaky Hardware.** In Dong Hoon Lee, Xiaoyun Wang, editors, *Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011*, volume 7073 of *Lecture Notes in Computer Science*, pages 722-739, 2011. Springer

Oded Goldreich, Shafi Goldwasser, Shai Halevi. **Collision-Free Hashing from Lattice Problems**. In Oded Goldreich, editor, *Studies in Complexity and Cryptography - Miscellanea on the Interplay between Randomness and Computation - In Collaboration*, volume 6650 of *Lecture Notes in Computer Science*, pages 30-39, 2011. Springer.

Eran Gat, Shafi Goldwasser. **Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications.** Electronic Colloquium on Computational Complexity (ECCC) 18: 136, 2011.

Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai. **Leakage-Resilient Coin Tossing.** IACR Cryptology ePrint Archive 2011: 291, 2011.

Shafi Goldwasser, Huijia Lin, Aviad Rubinstein. **Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs**. IACR Cryptology ePrint Archive 2011: 456, 2011.

Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum. **Program Obfuscation with Leaky Hardware.** IACR Cryptology ePrint Archive 2011: 660, 2011.

Shafi Goldwasser, Allison Lewko, and David
A. Wilson. **Bounded-Collusion IBE from Key Homomorphism.**
* Ninth IACR Theory of Cryptography Conference (TCC 2012)*, Taormina,
Italy, March 2012.

Shafi Goldwasser. **Pseudo-deterministic Algorithms (Invited Talk)**. *29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)*, pages 29, LIPIcs 14 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012.

Shafi Goldwasser, Guy N. Rothblum. **How to Compute in the Presence of Leakage.** Electronic Colloquium on Computational Complexity (ECCC) 19: 10, 2012.

Elette Boyle, Shafi Goldwasser, Abhishek Jain, and Yael Tauman Kalai. **Multiparty Computation Secure Against Continual Memory Leakage.** *Proceedings of the 44th ACM Symposium on Theory of Computing (STOC),* New York, NY, May 2012.

Adi Akavia, Shafi Goldwasser, Carmit Hazay. **Distributed Public Key Schemes Secure against Continual Leakage.** *Proceedings of the 31th Annual ACM Symposium on Principles of Distributed Computing (PODC 2012)*, Funchal, Madeira, Portugal, pages 155-164, July 2012.