{"id":"https://openalex.org/W2397586356","doi":null,"title":"Efficient Oblivious Parallel Array Reads and Writes for Secure Multiparty Computation.","display_name":"Efficient Oblivious Parallel Array Reads and Writes for Secure Multiparty Computation.","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2397586356","mag":"2397586356"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.572.5358","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.572.5358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://eprint.iacr.org/2014/630.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009632286","display_name":"Peeter Laud","orcid":"https://orcid.org/0000-0002-9030-8142","observed_orcids":["https://orcid.org/0000-0002-9030-8142"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peeter Laud","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9030-8142","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5009632286"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25543214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2014","issue":null,"first_page":"630","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11614","display_name":"Cloud Data Security Solutions","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/oblivious-ram","display_name":"oblivious RAM","score":0.718999981880188},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"secure multi-party computation","score":0.953000009059906},{"id":"https://openalex.org/keywords/oram","display_name":"ORAM","score":0.6190000176429749},{"id":"https://openalex.org/keywords/privacy-preserving-computation","display_name":"privacy-preserving computation","score":0.6880000233650208},{"id":"https://openalex.org/keywords/asymptotic-performance","display_name":"asymptotic performance","score":0.6669999957084656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8302404880523682},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5913796424865723},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.5444291234016418},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5079925656318665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1864742636680603}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.572.5358","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.572.5358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://eprint.iacr.org/2014/630.pdf","raw_type":"text"},{"id":"mag:2397586356","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/iacr/iacr2014.html#Laud14a","pdf_url":null,"source":{"id":"https://openalex.org/S2764847869","display_name":"IACR Cryptology ePrint Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":["https://openalex.org/P4322614454"],"host_organization_lineage_names":["Cryptology ePrint Archive"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Cryptology ePrint Archive","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3171320801","https://openalex.org/W2174542393","https://openalex.org/W1144617609","https://openalex.org/W3207039311","https://openalex.org/W7197047566","https://openalex.org/W2949129999","https://openalex.org/W7096921112","https://openalex.org/W2951525008","https://openalex.org/W3028839475","https://openalex.org/W2949742661"],"abstract_inverted_index":{"In":[0],"this":[1],"note":[2],"we":[3,54],"describe":[4],"efficient":[5],"protocols":[6],"to":[7,19,39,58],"perform":[8],"in":[9,15,74],"parallel":[10],"many":[11],"reads":[12],"and":[13,34],"writes":[14],"private":[16,20],"arrays":[17],"according":[18],"indices.":[21],"The":[22],"protocol":[23],"is":[24],"implemented":[25],"on":[26],"top":[27],"of":[28,48,84],"the":[29],"Arithmetic":[30],"Black":[31],"Box":[32],"(ABB)":[33],"can":[35],"be":[36],"freely":[37],"composed":[38],"build":[40],"larger":[41],"privacy-preserving":[42],"applications.":[43],"For":[44],"a":[45,81],"large":[46],"class":[47,83],"secure":[49],"multiparty":[50],"computation":[51],"(SMC)":[52],"protocols,":[53,86],"believe":[55],"our":[56,87],"technique":[57,67,88],"have":[59],"better":[60,90],"practical":[61],"performance":[62,92],"than":[63,93],"any":[64],"previous":[65,94],"ORAM":[66],"that":[68,79],"has":[69,89],"been":[70],"adapted":[71],"for":[72,80],"use":[73],"SMC.":[75],"We":[76],"also":[77],"argue":[78],"significant":[82],"SMC":[85],"asymptotic":[91],"approaches.":[95]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}