{"entities":{"Q6943933":{"pageid":21167184,"ns":120,"title":"Item:Q6943933","lastrevid":75947304,"modified":"2026-04-21T15:46:15Z","type":"item","id":"Q6943933","labels":{"en":{"language":"en","value":"The round complexity of perfect MPC with active security and optimal resiliency"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8079053"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943933$F3812740-DE75-443B-B78D-F318580F6714","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5357a64411b3a21632d4ae6bd77fc411b2f8c415","datavalue":{"value":{"text":"The round complexity of perfect MPC with active security and optimal resiliency","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6943933$7C3EDC71-E349-4323-822C-145E4384970D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ddd8ed27416eb3afba33e1eefa2812dd757d67ca","datavalue":{"value":"10.1109/FOCS46700.2020.00121","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943933$8777A79B-BB96-4F91-A8B9-57B1B33ED0AF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5cebe65ceea15cd93b2f459850477a2bdf6aabec","datavalue":{"value":{"entity-type":"item","numeric-id":301520,"id":"Q301520"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943933$FDE7F4C5-FA96-4580-9885-B5B0B0FD4D1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a45bfd80ec77a2e99b0006839e9b0cad33657911","datavalue":{"value":{"entity-type":"item","numeric-id":2119060,"id":"Q2119060"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943933$91517879-34E4-456E-B57D-6EA92B1E1185","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"89b630517b1d9b3e8f2950c25ce86991299820f8","datavalue":{"value":{"entity-type":"item","numeric-id":514476,"id":"Q514476"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943933$2D3DB81D-9570-4ACD-948A-0E1F6AF6F894","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6943933$08346CE2-6E73-4CB3-BC9D-68F3278723EA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943933$3EB1E20F-9F8E-4CD7-B4B3-A34566547ED3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1cd58125499687140dba08b5f225920b17e1f979","datavalue":{"value":"8079053","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943933$14008D8F-546A-4C9C-8E12-3F6E5D34AE30","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943933$463C0931-608A-4688-BB5B-A23A2E6B203C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The round complexity of perfect MPC with active security and optimal resiliency","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_round_complexity_of_perfect_MPC_with_active_security_and_optimal_resiliency"}}}}}