Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7444883> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q7444883 subject Q6121277.
- Q7444883 abstract "Secure two-party computation (2PC) is sub-problem of secure multi-party computation (MPC) that has received special attention by researchers because of its close relation to many cryptographic tasks. It is concerned with the question: 'Can two party computation be achieved more efficiently and under weaker security assumptions than general MPC?'Yao's protocol for two-party computation only provided security against passive adversaries. 2PC protocols that are secure against active adversaries were proposed by Lindell and Pinkas, Ishai, Prabhakaran and Sahai and Nielsen and Orlandi.Another solution for this problem, that explicitly works with committed input was proposed by Jarecki and Shmatikov.".
- Q7444883 wikiPageWikiLink Q131222.
- Q7444883 wikiPageWikiLink Q17008711.
- Q7444883 wikiPageWikiLink Q2142273.
- Q7444883 wikiPageWikiLink Q2465888.
- Q7444883 wikiPageWikiLink Q2915383.
- Q7444883 wikiPageWikiLink Q3304359.
- Q7444883 wikiPageWikiLink Q5157322.
- Q7444883 wikiPageWikiLink Q6121277.
- Q7444883 wikiPageWikiLink Q62888.
- Q7444883 wikiPageWikiLink Q659974.
- Q7444883 wikiPageWikiLink Q7604421.
- Q7444883 wikiPageWikiLink Q7894118.
- Q7444883 wikiPageWikiLink Q8789.
- Q7444883 comment "Secure two-party computation (2PC) is sub-problem of secure multi-party computation (MPC) that has received special attention by researchers because of its close relation to many cryptographic tasks. It is concerned with the question: 'Can two party computation be achieved more efficiently and under weaker security assumptions than general MPC?'Yao's protocol for two-party computation only provided security against passive adversaries.".
- Q7444883 label "Secure two-party computation".