FRINK Linked Data Fragments server

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

• W1567505539 endingPage "425" @default.
• W1567505539 startingPage "406" @default.
• W1567505539 abstract "Suppose that a receiver R wishes to publish an encryption of her secret input x so that every sender S, holding an input y, can reveal f(x, y) to R by sending her a single message. This should be done while simultaneously protecting the secrecy of y against a corrupted R and preventing a corrupted S from having an unfair influence on the output of R beyond what is allowed by f.When the parties are semi-honest, practical solutions can be based on Yao's garbled circuit technique. However, for the general problem when the parties, or even S alone, may be malicious, all known polynomial-time solutions are highly inefficient. This is due in part to the fact that known solutions make a non-black-box use of cryptographic primitives, e.g., for providing non-interactive zero-knowledge proofs of statements involving cryptographic computations on secrets.Motivated by the above question, we consider the problem of secure two-party computation in a model that allows only parallel calls to an ideal oblivious transfer (OT) oracle with no additional interaction. We obtain the following results. - Feasibility. We present the first general protocols in this model which only make a black-box use of a pseudorandom generator (PRG). All previous OT-based protocols either make a non-black-box use of cryptographic primitives or require multiple rounds of interaction. - Efficiency. We also consider the question of minimizing the asymptotic number of PRG calls made by such protocols. We show that polylog(κ) calls are sufficient for each gate in a (large) boolean circuit computing f, where κ is a statistical security parameter guaranteeing at most 2-κ simulation error of a malicious sender. Furthermore, the number of PRG calls per gate can be made constant by settling for a relaxed notion of security which allows a malicious S to arbitrarily correlate the event that R detects cheating with the input of R. This improves over the state of the art also for interactive constant-round black-box protocols, which required Ω(κ) PRG calls per gate, even with similar relaxations of the notion of security.Combining the above results with 2-message (parallel) OT protocols in the CRS model, we get the first solutions to the initial motivating question which only make a black-box use of standard cryptographic primitives." @default.
• W1567505539 created "2016-06-24" @default.
• W1567505539 creator A5020375635 @default.
• W1567505539 creator A5023747811 @default.
• W1567505539 creator A5036104549 @default.
• W1567505539 creator A5081852077 @default.
• W1567505539 creator A5087900012 @default.
• W1567505539 date "2011-01-01" @default.
• W1567505539 modified "2023-10-13" @default.
• W1567505539 title "Efficient Non-interactive Secure Computation" @default.
• W1567505539 cites W1500761685 @default.
• W1567505539 cites W1502935422 @default.
• W1567505539 cites W1515370218 @default.
• W1567505539 cites W1518622464 @default.
• W1567505539 cites W1521253015 @default.
• W1567505539 cites W1525012278 @default.
• W1567505539 cites W1526518474 @default.
• W1567505539 cites W1534543185 @default.
• W1567505539 cites W1541083511 @default.
• W1567505539 cites W1557386445 @default.
• W1567505539 cites W1558057988 @default.
• W1567505539 cites W1560201081 @default.
• W1567505539 cites W1574373886 @default.
• W1567505539 cites W1592625985 @default.
• W1567505539 cites W1623766202 @default.
• W1567505539 cites W1625658248 @default.
• W1567505539 cites W1663689473 @default.
• W1567505539 cites W173953576 @default.
• W1567505539 cites W1798609567 @default.
• W1567505539 cites W2031533839 @default.
• W1567505539 cites W2039605106 @default.
• W1567505539 cites W2040168265 @default.
• W1567505539 cites W2116653107 @default.
• W1567505539 cites W2142222275 @default.
• W1567505539 cites W2145009598 @default.
• W1567505539 cites W2145818182 @default.
• W1567505539 cites W2167236842 @default.
• W1567505539 cites W2233233025 @default.
• W1567505539 cites W2988890240 @default.
• W1567505539 doi "https://doi.org/10.1007/978-3-642-20465-4_23" @default.
• W1567505539 hasPublicationYear "2011" @default.
• W1567505539 type Work @default.
• W1567505539 sameAs 1567505539 @default.
• W1567505539 citedByCount "90" @default.
• W1567505539 countsByYear W15675055392012 @default.
• W1567505539 countsByYear W15675055392013 @default.
• W1567505539 countsByYear W15675055392014 @default.
• W1567505539 countsByYear W15675055392015 @default.
• W1567505539 countsByYear W15675055392016 @default.
• W1567505539 countsByYear W15675055392017 @default.
• W1567505539 countsByYear W15675055392018 @default.
• W1567505539 countsByYear W15675055392019 @default.
• W1567505539 countsByYear W15675055392020 @default.
• W1567505539 countsByYear W15675055392021 @default.
• W1567505539 countsByYear W15675055392022 @default.
• W1567505539 countsByYear W15675055392023 @default.
• W1567505539 crossrefType "book-chapter" @default.
• W1567505539 hasAuthorship W1567505539A5020375635 @default.
• W1567505539 hasAuthorship W1567505539A5023747811 @default.
• W1567505539 hasAuthorship W1567505539A5036104549 @default.
• W1567505539 hasAuthorship W1567505539A5081852077 @default.
• W1567505539 hasAuthorship W1567505539A5087900012 @default.
• W1567505539 hasBestOaLocation W15675055391 @default.
• W1567505539 hasConcept C11413529 @default.
• W1567505539 hasConcept C41008148 @default.
• W1567505539 hasConcept C45374587 @default.
• W1567505539 hasConceptScore W1567505539C11413529 @default.
• W1567505539 hasConceptScore W1567505539C41008148 @default.
• W1567505539 hasConceptScore W1567505539C45374587 @default.
• W1567505539 hasLocation W15675055391 @default.
• W1567505539 hasOpenAccess W1567505539 @default.
• W1567505539 hasPrimaryLocation W15675055391 @default.
• W1567505539 hasRelatedWork W1534842550 @default.
• W1567505539 hasRelatedWork W1540323719 @default.
• W1567505539 hasRelatedWork W1572523360 @default.
• W1567505539 hasRelatedWork W1587906417 @default.
• W1567505539 hasRelatedWork W2067951144 @default.
• W1567505539 hasRelatedWork W2352648941 @default.
• W1567505539 hasRelatedWork W2354062721 @default.
• W1567505539 hasRelatedWork W2375463041 @default.
• W1567505539 hasRelatedWork W2624454569 @default.
• W1567505539 hasRelatedWork W2908068254 @default.
• W1567505539 isParatext "false" @default.
• W1567505539 isRetracted "false" @default.
• W1567505539 magId "1567505539" @default.
• W1567505539 workType "book-chapter" @default.