FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2151854364> ?p ?o ?g. }

• W2151854364 abstract "The game is simple and apparently paradoxical: Prove you know something— an ID number, an access code—without revealing even a single bit of the information itself. The importance is obvious: from credit card numbers to computer passwords, we are increasingly reliant on the secure electronic transmission of what are known as signatures. Yet how can one transmit a signature without potentially revealing to an eavesdropper—or an unethical vendor—all the information he needs in order to masquerade as the sender? Three Israeli computer scientists—Uriel Feige, Amos Fiat and Adi Shamir, of the Weizmann Institute—figured out how to play the game, called zero knowledge proofs of identity. They publicized their result at conferences, and they applied for U.S. patent protection. Ironically the United States said disclosure was detrimental to the national security, and imposed a secrecy order. The three Israelis sought relief, and, with intervention from powerful sources, they got it. Though no one will say for certain, it appears that the National Security Agency (NSA), the government decrypter of secrets, stepped in to help. What the research is, and why the NSA had reason to involve itself, is the story we present here. The technical part has its genesis in the work of Stephen Cook and Richard Karp of the early seventies. Our model of a computer is a RAM, a Random Access Machine. At issue is complexity: on a problem of input size m, how many steps does it take as a function of m to solve the problem? Certain problems are easy; by the obvious method, two m x m matrices can be multiplied in O(m 3) steps (although there are considerably more sophisticated algorithms which require only O(m2-376) steps). Other problems are less obvious. The crucial distinction comes between those problems with polynomial time solutions (the class P), and those which require more than polynomial time. The latter are considered, infeasible. What Cook did was to show that the question Is a boolean expression satisfiable? occupies a special place in the hierarchy of problems. It is solvable in polynomial time by a nondeterministic RAM1 (it is in NP, Nondeterministic Polynomial time), and it is as hard as any other problem in NP (it is complete). If satisfiabilit y has a polynomial time solution, so will any other problem in NP. Karp then showed that a number of combinatorial problems shared that characteristic, called NP-completeness, including kcolorability (can the vertices of a given undirected graph be colored with k colors so that no two adjacent vertices have the same color?), knapsack (given » finite set of integers «,, is there a subset which sums to an integer Kl), This article is the seventeenth in the series of Special Articles published in the Notices. The author, Susan Landau, is an assistant professor of computer science at Weslyan University. She received her Ph. D from M.I.T.; her thesis gave a polynomial time method for determining solvability by radicals. Her research interests include computational complexity and algebra." @default.
• W2151854364 created "2016-06-24" @default.
• W2151854364 creator A5086120667 @default.
• W2151854364 date "1988-01-01" @default.
• W2151854364 modified "2023-09-24" @default.
• W2151854364 title "ZERO KNOWLEDGE AND THE DEPARTMENT OF DEFENSE" @default.
• W2151854364 cites W1589034595 @default.
• W2151854364 cites W1970606468 @default.
• W2151854364 cites W1979215153 @default.
• W2151854364 cites W1996360405 @default.
• W2151854364 cites W2005317356 @default.
• W2151854364 cites W2012857639 @default.
• W2151854364 cites W2036265926 @default.
• W2151854364 cites W2093297089 @default.
• W2151854364 cites W2148373594 @default.
• W2151854364 cites W2152005134 @default.
• W2151854364 cites W2798876354 @default.
• W2151854364 hasPublicationYear "1988" @default.
• W2151854364 type Work @default.
• W2151854364 sameAs 2151854364 @default.
• W2151854364 citedByCount "3" @default.
• W2151854364 crossrefType "journal-article" @default.
• W2151854364 hasAuthorship W2151854364A5086120667 @default.
• W2151854364 hasConcept C10138342 @default.
• W2151854364 hasConcept C108827166 @default.
• W2151854364 hasConcept C109297577 @default.
• W2151854364 hasConcept C136764020 @default.
• W2151854364 hasConcept C144133560 @default.
• W2151854364 hasConcept C145097563 @default.
• W2151854364 hasConcept C17744445 @default.
• W2151854364 hasConcept C182306322 @default.
• W2151854364 hasConcept C198104137 @default.
• W2151854364 hasConcept C199539241 @default.
• W2151854364 hasConcept C2776452267 @default.
• W2151854364 hasConcept C2983355114 @default.
• W2151854364 hasConcept C38652104 @default.
• W2151854364 hasConcept C41008148 @default.
• W2151854364 hasConcept C76155785 @default.
• W2151854364 hasConceptScore W2151854364C10138342 @default.
• W2151854364 hasConceptScore W2151854364C108827166 @default.
• W2151854364 hasConceptScore W2151854364C109297577 @default.
• W2151854364 hasConceptScore W2151854364C136764020 @default.
• W2151854364 hasConceptScore W2151854364C144133560 @default.
• W2151854364 hasConceptScore W2151854364C145097563 @default.
• W2151854364 hasConceptScore W2151854364C17744445 @default.
• W2151854364 hasConceptScore W2151854364C182306322 @default.
• W2151854364 hasConceptScore W2151854364C198104137 @default.
• W2151854364 hasConceptScore W2151854364C199539241 @default.
• W2151854364 hasConceptScore W2151854364C2776452267 @default.
• W2151854364 hasConceptScore W2151854364C2983355114 @default.
• W2151854364 hasConceptScore W2151854364C38652104 @default.
• W2151854364 hasConceptScore W2151854364C41008148 @default.
• W2151854364 hasConceptScore W2151854364C76155785 @default.
• W2151854364 hasLocation W21518543641 @default.
• W2151854364 hasOpenAccess W2151854364 @default.
• W2151854364 hasPrimaryLocation W21518543641 @default.
• W2151854364 hasRelatedWork W1598813767 @default.
• W2151854364 hasRelatedWork W1679286871 @default.
• W2151854364 hasRelatedWork W1964977674 @default.
• W2151854364 hasRelatedWork W1992305362 @default.
• W2151854364 hasRelatedWork W1992319863 @default.
• W2151854364 hasRelatedWork W2016381622 @default.
• W2151854364 hasRelatedWork W2035142022 @default.
• W2151854364 hasRelatedWork W2074085132 @default.
• W2151854364 hasRelatedWork W2082934947 @default.
• W2151854364 hasRelatedWork W2086999408 @default.
• W2151854364 hasRelatedWork W2087237939 @default.
• W2151854364 hasRelatedWork W2094212430 @default.
• W2151854364 hasRelatedWork W2122223249 @default.
• W2151854364 hasRelatedWork W2206805343 @default.
• W2151854364 hasRelatedWork W2246373499 @default.
• W2151854364 hasRelatedWork W2253401910 @default.
• W2151854364 hasRelatedWork W50776579 @default.
• W2151854364 hasRelatedWork W1945534885 @default.
• W2151854364 hasRelatedWork W2187130719 @default.
• W2151854364 hasRelatedWork W2535578332 @default.
• W2151854364 isParatext "false" @default.
• W2151854364 isRetracted "false" @default.
• W2151854364 magId "2151854364" @default.
• W2151854364 workType "article" @default.