FRINK Linked Data Fragments server

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

• W1966205523 abstract "We initiate the study of compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problems. We consider NP problems that have long instances but relatively short witnesses. The question is, can one efficiently compress an instance and store a shorter representation that maintains the information of whether the original input is in the language or not. We want the length of the compressed instance to be polynomial in the length of the witness rather than the length of original input. Such compression enables to succinctly store instances until a future setting will allow solving them, either via a technological or algorithmic breakthrough or simply until enough time has elapsed. We give a new classification of NP with respect to compression. This classification forms a stratification of NP that we call the VC hierarchy. The hierarchy is based on a new type of reduction called W-reduction and there are compression-complete problems for each class. Our motivation for studying this issue stems from the vast cryptographic implications compressibility has. For example, we say that SAT is compressible if there exists a polynomial p(middot, middot) so that given a formula consisting of m clauses over n variables it is possible to come up with an equivalent (w.r.t satisfiability) formula of size at most p(n, log m). Then given a compression algorithm for SAT we provide a construction of collision resistant hash functions from any one-way function. This task was shown to be impossible via black-box reductions (D. Simon, 1998), and indeed the construction presented is inherently non-black-box. Another application of SAT compressibility is a cryptanalytic result concerning the limitation of everlasting security in the bounded storage model when mixed with (time) complexity based cryptography. In addition, we study an approach to constructing an oblivious transfer protocol from any one-way function. This approach is based on compression for SAT that also has a property that we call witness retrievability. However, we mange to prove severe limitations on the ability to achieve witness retrievable compression of SAT" @default.
• W1966205523 created "2016-06-24" @default.
• W1966205523 creator A5002372704 @default.
• W1966205523 creator A5036936298 @default.
• W1966205523 date "2006-10-01" @default.
• W1966205523 modified "2023-09-23" @default.
• W1966205523 title "On the Compressibility of NP Instances and Cryptographic Applications" @default.
• W1966205523 cites W1548130906 @default.
• W1966205523 cites W1684108869 @default.
• W1966205523 cites W1968372742 @default.
• W1966205523 cites W1972792640 @default.
• W1966205523 cites W1980147712 @default.
• W1966205523 cites W2004881597 @default.
• W1966205523 cites W2012045293 @default.
• W1966205523 cites W2015880590 @default.
• W1966205523 cites W2021131202 @default.
• W1966205523 cites W2025897717 @default.
• W1966205523 cites W2036265926 @default.
• W1966205523 cites W2040579873 @default.
• W1966205523 cites W2049198367 @default.
• W1966205523 cites W2091915899 @default.
• W1966205523 cites W2120154759 @default.
• W1966205523 cites W2126661026 @default.
• W1966205523 cites W2133817484 @default.
• W1966205523 cites W2143112402 @default.
• W1966205523 cites W2152688060 @default.
• W1966205523 cites W2153417364 @default.
• W1966205523 cites W2156186849 @default.
• W1966205523 cites W2159460804 @default.
• W1966205523 cites W2293021588 @default.
• W1966205523 cites W2337710787 @default.
• W1966205523 cites W2403800580 @default.
• W1966205523 cites W4230960895 @default.
• W1966205523 cites W4243680187 @default.
• W1966205523 cites W4292230561 @default.
• W1966205523 doi "https://doi.org/10.1109/focs.2006.54" @default.
• W1966205523 hasPublicationYear "2006" @default.
• W1966205523 type Work @default.
• W1966205523 sameAs 1966205523 @default.
• W1966205523 citedByCount "70" @default.
• W1966205523 countsByYear W19662055232012 @default.
• W1966205523 countsByYear W19662055232013 @default.
• W1966205523 countsByYear W19662055232014 @default.
• W1966205523 countsByYear W19662055232015 @default.
• W1966205523 countsByYear W19662055232016 @default.
• W1966205523 countsByYear W19662055232017 @default.
• W1966205523 countsByYear W19662055232018 @default.
• W1966205523 countsByYear W19662055232019 @default.
• W1966205523 countsByYear W19662055232021 @default.
• W1966205523 crossrefType "proceedings-article" @default.
• W1966205523 hasAuthorship W1966205523A5002372704 @default.
• W1966205523 hasAuthorship W1966205523A5036936298 @default.
• W1966205523 hasConcept C121332964 @default.
• W1966205523 hasConcept C15927051 @default.
• W1966205523 hasConcept C178489894 @default.
• W1966205523 hasConcept C33884865 @default.
• W1966205523 hasConcept C38652104 @default.
• W1966205523 hasConcept C41008148 @default.
• W1966205523 hasConcept C80444323 @default.
• W1966205523 hasConcept C84655787 @default.
• W1966205523 hasConcept C97355855 @default.
• W1966205523 hasConceptScore W1966205523C121332964 @default.
• W1966205523 hasConceptScore W1966205523C15927051 @default.
• W1966205523 hasConceptScore W1966205523C178489894 @default.
• W1966205523 hasConceptScore W1966205523C33884865 @default.
• W1966205523 hasConceptScore W1966205523C38652104 @default.
• W1966205523 hasConceptScore W1966205523C41008148 @default.
• W1966205523 hasConceptScore W1966205523C80444323 @default.
• W1966205523 hasConceptScore W1966205523C84655787 @default.
• W1966205523 hasConceptScore W1966205523C97355855 @default.
• W1966205523 hasLocation W19662055231 @default.
• W1966205523 hasOpenAccess W1966205523 @default.
• W1966205523 hasPrimaryLocation W19662055231 @default.
• W1966205523 hasRelatedWork W1553564935 @default.
• W1966205523 hasRelatedWork W1554274402 @default.
• W1966205523 hasRelatedWork W1575556365 @default.
• W1966205523 hasRelatedWork W2008685380 @default.
• W1966205523 hasRelatedWork W2026449948 @default.
• W1966205523 hasRelatedWork W2532895642 @default.
• W1966205523 hasRelatedWork W2949937073 @default.
• W1966205523 hasRelatedWork W3034338022 @default.
• W1966205523 hasRelatedWork W32627634 @default.
• W1966205523 hasRelatedWork W1585142320 @default.
• W1966205523 isParatext "false" @default.
• W1966205523 isRetracted "false" @default.
• W1966205523 magId "1966205523" @default.
• W1966205523 workType "article" @default.