Goldwasser, S. (Shafi) 1958
Overview
Works:  46 works in 133 publications in 2 languages and 1,524 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Editor, Author, Other, Restager , Creator 
Publication Timeline
.
Most widely held works by
S Goldwasser
Cryptology and computational number theory by
Carl Pomerance(
Book
)
13 editions published between 1990 and 2000 in English and held by 429 WorldCat member libraries worldwide
13 editions published between 1990 and 2000 in English and held by 429 WorldCat member libraries worldwide
Advances in cryptologyCRYPTO '88 : proceedings by
CRYPTO '88(
Book
)
29 editions published between 1989 and 2000 in English and held by 399 WorldCat member libraries worldwide
"CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudorandomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zeroknowledge and oblivious transfer, multiparty computation."Publisher's website
29 editions published between 1989 and 2000 in English and held by 399 WorldCat member libraries worldwide
"CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudorandomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zeroknowledge and oblivious transfer, multiparty computation."Publisher's website
Complexity of lattice problems : a cryptographic perspective by
Daniele Micciancio(
Book
)
17 editions published between 2002 and 2013 in English and held by 245 WorldCat member libraries worldwide
"Complexity of Lattice Problems: A Cryptographic Perspective is an essential reference for those researching ways in which lattice problems can be used to build cryptographic systems. It will also be of interest to those working in computational complexity, combinatorics, and foundations of cryptography."Jacket
17 editions published between 2002 and 2013 in English and held by 245 WorldCat member libraries worldwide
"Complexity of Lattice Problems: A Cryptographic Perspective is an essential reference for those researching ways in which lattice problems can be used to build cryptographic systems. It will also be of interest to those working in computational complexity, combinatorics, and foundations of cryptography."Jacket
35th Annual Symposium on Foundations of Computer Science : proceedings ; November 2022, 1994, Santa Fe, New Mexico by
S Goldwasser(
)
7 editions published between 1994 and 1997 in English and held by 209 WorldCat member libraries worldwide
7 editions published between 1994 and 1997 in English and held by 209 WorldCat member libraries worldwide
Advances in cryptology : CRYPTO '88 : proceedings; [a conference on the theory and applications of cryptology held at the
University of California, Santa Barbara, August 21  25, 1988](
)
2 editions published between 1990 and 2000 in English and held by 48 WorldCat member libraries worldwide
2 editions published between 1990 and 2000 in English and held by 48 WorldCat member libraries worldwide
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference by
S Goldwasser(
)
2 editions published in 2012 in English and held by 38 WorldCat member libraries worldwide
2 editions published in 2012 in English and held by 38 WorldCat member libraries worldwide
Advances in Cryptology  CRYPTO '88 by
S Goldwasser(
)
4 editions published between 1990 and 2008 in English and held by 31 WorldCat member libraries worldwide
Annotation
4 editions published between 1990 and 2008 in English and held by 31 WorldCat member libraries worldwide
Annotation
Cryptology and computational number theory : [lecture notes prepared for the American Mathematical Society Short Course Cryptology
and Computational Number Theory, held in Boulder, Colorado, August 67, 1989](
Book
)
1 edition published in 1990 in English and held by 22 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 22 WorldCat member libraries worldwide
ITCS12 2012 : Innovations in Theoretical Computer Science : January 810, 2012, Cambridge, MA, USA by
S Goldwasser(
)
2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide
2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide
Foundations of Computer Science, 35th Symposium on (FOCS '94 by
S Goldwasser(
)
2 editions published in 1994 in English and held by 10 WorldCat member libraries worldwide
The proceedings of FOCS'94, sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and held in November 1994, comprise 70 unrefereed technical papers (many representing reports of continuing research) and three plenary papers. The subjects of the plenary papers: Algorithmic number theorythe complexity contribution, by L.M. Adelman; Program resultcheckinga theory of testing meets a test of theory, by M. Blum and H. Wasserman; and Markov chains and polynomial time algorithms, by R. Kannan. No index. Annotation copyright by Book News, Inc., Portland, OR
2 editions published in 1994 in English and held by 10 WorldCat member libraries worldwide
The proceedings of FOCS'94, sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, and held in November 1994, comprise 70 unrefereed technical papers (many representing reports of continuing research) and three plenary papers. The subjects of the plenary papers: Algorithmic number theorythe complexity contribution, by L.M. Adelman; Program resultcheckinga theory of testing meets a test of theory, by M. Blum and H. Wasserman; and Markov chains and polynomial time algorithms, by R. Kannan. No index. Annotation copyright by Book News, Inc., Portland, OR
Probabilistic encryption : theory and applications by
S Goldwasser(
)
8 editions published between 1984 and 1988 in English and Undetermined and held by 10 WorldCat member libraries worldwide
8 editions published between 1984 and 1988 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Cryptology and computational number theory(
Book
)
1 edition published in 1990 in English and held by 9 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 9 WorldCat member libraries worldwide
The complexity of decision versus search by
Mihir Bellare(
Book
)
4 editions published between 1991 and 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and non deterministic doubleexponential time are unequal) we construct a language in NP for which search does not reduce to decision. These ideas extend in a natural way to interactive proofs and program checking. Under similar assumptions we present languages in NP for which it is harder to prove membership interactively than it is to decide this membership, and languages in NP which are not checkable."
4 editions published between 1991 and 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption (that deterministic and non deterministic doubleexponential time are unequal) we construct a language in NP for which search does not reduce to decision. These ideas extend in a natural way to interactive proofs and program checking. Under similar assumptions we present languages in NP for which it is harder to prove membership interactively than it is to decide this membership, and languages in NP which are not checkable."
Advances in cryptology : Conference on the theory and application of cryptography : Papers(
Book
)
1 edition published in 1989 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 6 WorldCat member libraries worldwide
The complexity of decision versus search by
Mihir Bellare(
Book
)
1 edition published in 1991 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 5 WorldCat member libraries worldwide
How to construct random functions by
Oded Goldreich(
Book
)
2 editions published in 1983 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1983 in English and held by 4 WorldCat member libraries worldwide
Interactive proofs and applications by
S Goldwasser(
Book
)
2 editions published between 1990 and 1991 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 1990 and 1991 in English and held by 3 WorldCat member libraries worldwide
Incremental cryptography : the case of hashing and signing by
Mihir Bellare(
Book
)
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We initiate the investigation of a kind of efficiency for cryptographic transformations. The idea is that having once applied the transformation to some document M, the time to update the result upon modification of M should be 'proportional' to the 'amount of modification' done to M. Thereby one obtains much faster cryptographic primitives for environments where closely related documents are undergoing the same cryptographic transformations. We provide some basic definitions enabling treatment of the new notion. We then exemplify our approach by suggesting incremental schemes for hashing and signing which are efficient according to our new measure."
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We initiate the investigation of a kind of efficiency for cryptographic transformations. The idea is that having once applied the transformation to some document M, the time to update the result upon modification of M should be 'proportional' to the 'amount of modification' done to M. Thereby one obtains much faster cryptographic primitives for environments where closely related documents are undergoing the same cryptographic transformations. We provide some basic definitions enabling treatment of the new notion. We then exemplify our approach by suggesting incremental schemes for hashing and signing which are efficient according to our new measure."
Foundations of Computer Science : Proceedings, 35th Annual Symposium on Foundations of Computer Science, November 2022, 1994
Santa Fe, New Mexico by Symposium on Foundations of Computer Science(
Book
)
3 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Ango riron no tameno koshi no sugaku(
Book
)
2 editions published in 2006 in Japanese and held by 3 WorldCat member libraries worldwide
2 editions published in 2006 in Japanese and held by 3 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Coding theory Computational complexity Computer engineering Computers ComputersAccess control Computer science Computer scienceMathematics Computer scienceResearch Computer security Cryptography Data encryption (Computer science) Data structures (Computer science) Distribution (Probability theory) Electrical engineering Electronic data processing Information theory Lattice theory Machine theory Management information systems NPcomplete problems Number theory Random variables Statistics
Covers
Alternative Names
Goldwasser, S.
Goldwasser, Shafi 1958
Goldwasser, Shafrira 1958
Shafi Goldwasser
Shafi Goldwasser informatica statunitense
Shafrira Goldwasser Amerikaans wiskundige
Shafrira Goldwasser informaticienne américaine
Shafrira Goldwasser ingeniera eléctrica, científica de la computación y matemática estadounidense
Shafrira Goldwasser USamerikanische Informatikerin
Гольдвассер, Шафи
Шафі Ґолдвассер
שפי גולדווסר
שפי גולדווסר מדענית מחשוב אמריקאית
شافريرا غولدفاسر
شفیع قولدواسر
شفیع گولدواسر
শফি গোল্ডওয়েসার
ゴールドヴァッサー, S
シャフィ・ゴールドワッサー アメリカ合衆国のコンピュータ科学者
莎菲·戈德瓦塞尔
莎菲·戈德瓦塞尔 IsraeliAmerican mathematician, computer scientist
Languages