Shafi Goldwasser

From MaRDI portal
Person:178475

Available identifiers

zbMath Open goldwasser.shafiWikidataQ11609 ScholiaQ11609MaRDI QIDQ178475

List of research outcomes

PublicationDate of PublicationType
Deniable encryption in a Quantum world2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q61153992023-07-12Paper
https://portal.mardi4nfdi.de/entity/Q58757862023-02-03Paper
Homomorphic Encryption Standard2022-11-02Paper
Deniable fully homomorphic encryption from learning with errors2022-04-22Paper
Formalizing data deletion in the context of the right to be forgotten2022-03-23Paper
https://portal.mardi4nfdi.de/entity/Q49932802021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51114182020-05-27Paper
Fine-grained Complexity Meets IP = PSPACE2019-10-15Paper
Population Stability2019-09-19Paper
Delegating Computation2018-08-02Paper
https://portal.mardi4nfdi.de/entity/Q46380622018-05-03Paper
The hunting of the SNARK2018-02-15Paper
The edited truth2018-01-19Paper
The Hidden Graph Model2017-05-19Paper
The Computational Benefit of Correlated Instances2017-05-19Paper
On the possibilities and limitations of pseudodeterministic algorithms2017-05-16Paper
On the Cryptographic Applications of Random Functions (Extended Abstract)2017-04-10Paper
A “Paradoxical” Solution to The Signature Problem2017-04-10Paper
Efficient probabilistic checkable proofs and applications to approximation2016-09-01Paper
How to Incentivize Data-Driven Collaboration Among Competing Parties2016-04-15Paper
Time-Lock Puzzles from Randomized Encodings2016-04-15Paper
Cryptographic Assumptions: A Position Paper2016-03-23Paper
Adaptively Secure Coin-Flipping, Revisited2015-11-04Paper
How to Compute in the Presence of Leakage2015-11-04Paper
Aggregate Pseudorandom Functions and Connections to Learning2015-07-06Paper
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation2015-07-06Paper
Efficient probabilistically checkable proofs and applications to approximations2015-05-07Paper
Distributed public key schemes secure against continual leakage2014-12-05Paper
On basing one-way functions on NP-hardness2014-11-25Paper
Resettable zero-knowledge (extended abstract)2014-09-26Paper
On best-possible obfuscation2014-09-25Paper
Erratum for2014-08-13Paper
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator2014-08-07Paper
Reusable garbled circuits and succinct functional encryption2014-08-07Paper
Leakage-resilient coin tossing2014-07-11Paper
Multi-input Functional Encryption2014-05-27Paper
Multiparty computation secure against continual memory leakage2014-05-13Paper
Functional Signatures and Pseudorandom Functions2014-03-25Paper
How to Run Turing Machines on Encrypted Data2013-09-17Paper
Communication Locality in Secure Multi-party Computation2013-03-18Paper
Bounded-Collusion IBE from Key Homomorphism2012-06-15Paper
Program Obfuscation with Leaky Hardware2011-12-02Paper
Leakage-Resilient Coin Tossing2011-10-28Paper
Collision-Free Hashing from Lattice Problems2011-08-19Paper
Black-Box Circular-Secure Encryption beyond Affine Functions2011-05-19Paper
On the Implementation of Huge Random Objects2011-04-04Paper
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability2010-08-24Paper
Securing Computation against Continuous Leakage2010-08-24Paper
Public-Key Encryption Schemes with Auxiliary Inputs2010-02-24Paper
Theory of Cryptography2009-05-14Paper
Cryptography without (Hardly Any) Secrets ?2009-05-12Paper
Simultaneous Hardcore Bits and Cryptography against Memory Attacks2009-03-03Paper
Weak Verifiable Random Functions2009-03-03Paper
One-Time Programs2009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q35496432009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35496912009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35496942009-01-05Paper
How to Protect Yourself without Perfect Shredding2008-08-19Paper
Program Obfuscation and One-Time Programs2008-04-24Paper
Secure Computation from Random Error Correcting Codes2007-11-29Paper
On Best-Possible Obfuscation2007-08-30Paper
Distributed Computing2006-11-01Paper
Secure multi-party computation without agreement2006-09-12Paper
Theory of Cryptography2005-12-07Paper
Property testing and its connection to learning and approximation2005-01-25Paper
Primality testing using elliptic curves2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48298102004-12-01Paper
https://portal.mardi4nfdi.de/entity/Q44187842004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44371122003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44187762003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q31496762002-09-30Paper
https://portal.mardi4nfdi.de/entity/Q45425142002-09-17Paper
Testing monotonicity2001-06-12Paper
On the limits of nonapproximability of lattice problems2001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q49406982000-03-01Paper
An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)1999-10-05Paper
https://portal.mardi4nfdi.de/entity/Q43186961999-08-30Paper
https://portal.mardi4nfdi.de/entity/Q42340501999-07-26Paper
https://portal.mardi4nfdi.de/entity/Q43645461998-06-25Paper
Fault-tolerant Computation in the Full Information Model1998-05-10Paper
Interactive proofs and the hardness of approximating cliques1998-01-21Paper
https://portal.mardi4nfdi.de/entity/Q43645451998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43645581998-01-07Paper
The knowledge complexity of interactive proof-systems1997-11-13Paper
https://portal.mardi4nfdi.de/entity/Q42795651994-09-20Paper
Randomness in interactive proofs1994-05-08Paper
The Complexity of Decision Versus Search1994-04-27Paper
https://portal.mardi4nfdi.de/entity/Q40112531992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39740931992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q32101411991-01-01Paper
On the power of interaction1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32101631990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32122761990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57503981990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38305311989-01-01Paper
The Knowledge Complexity of Interactive Proof Systems1989-01-01Paper
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37242351986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37299021986-01-01Paper
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information1985-01-01Paper
Probabilistic encryption1984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shafi Goldwasser