skip to content

Goldwasser, S. (Shafi) 1958-

Overview
Works: 37 works in 87 publications in 2 languages and 1,070 library holdings
Genres: Conference proceedings 
Roles: Editor, Creator
Classifications: QA76.9.A25, 005.8
Publication Timeline
Key
Publications about S Goldwasser
Publications by S Goldwasser
Most widely held works by S Goldwasser
Cryptology and computational number theory ( Book )
8 editions published in 1990 in English and held by 399 libraries worldwide
Advances in cryptology--CRYPTO '88 : proceedings by S Goldwasser( Book )
23 editions published between 1989 and 2000 in English and held by 332 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?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation."--Publisher's website
Complexity of lattice problems : a cryptographic perspective by Daniele Micciancio( Book )
5 editions published in 2002 in English and held by 179 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."--BOOK JACKET
35th Annual Symposium on Foundations of Computer Science : proceedings ; November 20-22, 1994, Santa Fe, New Mexico by Symposium on Foundations of Computer Science( Book )
6 editions published in 1994 in English and held by 12 libraries worldwide
Proceedings by 1994, Santa Fé, NM) Symposium on Foundations of Computer Science (35( Book )
1 edition published in 1994 in English and held by 9 libraries worldwide
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference by S Goldwasser( Computer File )
1 edition published in 2012 in English and held by 8 libraries worldwide
The complexity of decision versus search by Mihir Bellare( Book )
3 editions published between 1991 and 1992 in English and held by 8 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 double-exponential 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."
How to construct random functions by Oded Goldreich( Book )
1 edition published in 1983 in English and held by 4 libraries worldwide
Advances in cryptology : Conference on the theory and application of cryptography : Papers ( Book )
1 edition published in 1989 in English and held by 3 libraries worldwide
Interactive proofs and applications by S Goldwasser( Book )
2 editions published between 1990 and 1991 in English and held by 3 libraries worldwide
35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, New Mexico : Proceedings ( Book )
1 edition published in 1994 in English and held by 3 libraries worldwide
Foundations of Computer Science, 35th Symposium on (FOCS '94) by S Goldwasser( Computer File )
1 edition published in 1994 in English and held by 3 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 theory--the complexity contribution, by L.M. Adelman; Program result-checking--a 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
[Special issue dedicated to the Symposium on Foundations of Computer Science (FOCS), held in Santa Fe, New Mexico, November 20-22, 1994] ( Computer File )
2 editions published in 1997 in English and held by 3 libraries worldwide
Incremental cryptography : the case of hashing and signing by Mihir Bellare( Book )
1 edition published in 1994 in English and held by 2 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."
Angō riron no tameno kōshi no sūgaku ( Book )
2 editions published in 2006 in Japanese and held by 2 libraries worldwide
The Weizmann workshop on probabilistic proof systems by U Feige( Book )
1 edition published in 1994 in English and held by 2 libraries worldwide
Abstract: " The Weizmann Workshop on Probabilistic Proofs and Applications to Program Checking, Cryptography, and Hardness of Approximation was held at the Weizmann Institute of Science, on January 10- 13, 1994. The following report provides the abstracts of the talks given at the workshop, the list of participants, and relevant references."
Invariant signatures and non-interactive zero-knowledge proofs are equivalent by S Goldwasser( Book )
1 edition published in 1992 in English and held by 2 libraries worldwide
Abstract: "The standard definition of digital signatures allows a document to have many valid signatures. In this paper, we consider a subclass of digital signatures, called invariant signatures, in which all legal signatures of a document must be identical according to some polynomial-time computable function (of a signature) which is hard to predict given an unsigned document. We formalize this notion and show its equivalence to non-interactive zero-knowledge proofs."
 
moreShow More Titles
fewerShow Fewer Titles
Alternative Names
Goldwasser, S.
Goldwasser, Shafi, 1958-
Goldwasser, Shafrira, 1958-
ゴールドヴァッサー, S
Languages
English (68)
Japanese (2)
Covers
Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.