Yahoo Malaysia Web Search

Sign In

Search results

  1. drops.dagstuhl.de › entities › documentOptimal PSPACE-Hardness of Approximating Set Cover...

    4 days ago · We prove that Minmax Set Cover Reconfiguration and Minmax Dominating Set Reconfiguration are PSPACE-hard to approximate within a factor of 2- (1/polyloglog N), where N is the size of the universe and the number of vertices in a graph, respectively, improving upon Ohsaka (SODA 2024) [Ohsaka, 2024] and Karthik C. S. and Manurangsi (2023) [Karthik ...

  2. artis80.blogArt is 80 – Is it too late to have interesting thoughts……or too...

    4 days ago · This effort started only seven years ago, at the Radcliffe Institute for Advanced Studies, when two scientists, David Gruber of the City University of New York and Shafi Goldwasser of MIT, had a chance encounter, then joined by Michael Bronstein, who now teaches at Oxford.

  3. dl.acm.org › doi › 10Delegating FIDO Credentials Using Single-use ECDSA Signatures

    5 days ago · Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. 2008. One-Time Programs. In Advances in Cryptology - CRYPTO 2008 (Lecture Notes in Computer Science, Vol. 5157) , David Wagner (Ed.).

  4. dblp.org › db › confdblp: CRYPTO

    2 days ago · Shafi Goldwasser: Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings. Lecture Notes in Computer Science 403, Springer 1990 , ISBN 3-540-97196-3 [contents]

  5. link.springer.com › article › 10Tree-based quantum anonymous ranking protocol

    1 day ago · How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 307–328 (2019) Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation.

  6. dl.acm.org › doi › absPhysical-Layer Public Key Encryption Through Massive MIMO

    5 days ago · Oded Goldreich, Shafi Goldwasser, and Shai Halevi. 1997. Public-key cryptosystems from lattice reduction problems. In Advances in Cryptology --- CRYPTO '97, Burton S. Kaliski (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 112--131.

  7. dl.acm.org › doi › fullZero-Knowledge Proofs and Their Role within the Blockchain

    4 days ago · The concept of zero-knowledge proofs was initially outlined in the 1985 MIT paper “The Knowledge Complexity of Interactive Proof-Systems,” which was written by Shafi Goldwasser and Silvio Micali. The paper outlined how it was possible to provide a distinct statement about a data point, which could be verified as true, without the need to ...