[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_393":394},"routes/_layout",{"_11":303},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_60":61,"_62":63},"type","person","id","person_A5073301367","section","articles","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":-5,"_50":-5,"_51":-5,"_52":-5,"_53":-5,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":30,"_59":-5},"canonical","https://www.hugmap.com/entity/person/person_A5073301367/articles","siteBaseUrl","https://www.hugmap.com","sectionCount",0,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Shai Halevi\",\"url\":\"https://www.hugmap.com/entity/person/person_A5073301367/articles\",\"@type\":\"Person\",\"jobTitle\":null},{\"@type\":\"CollectionPage\",\"name\":\"Shai Halevi 相关文章\",\"description\":\"Shai Halevi 在 HugMap 中的相关文章，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/person/person_A5073301367/articles\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"人物\",\"item\":\"https://www.hugmap.com/search?type=person\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Shai Halevi\",\"item\":\"https://www.hugmap.com/entity/person/person_A5073301367\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关文章\",\"item\":\"https://www.hugmap.com/entity/person/person_A5073301367/articles\"}]}]}","name","Shai Halevi","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"A5073301367\",\"orcid\":\"0000-0003-3432-7899\"}","properties","source","openalex","createdAt","2026-05-14T05:04:44.292425979","updatedAt","2026-05-23T09:19:59.205849938","orcid","0000-0003-3432-7899","title","affiliation","researchArea","paperCount","citationCount","homepage","linkedin","twitter","github","hindex","displayName","displayDescription","mutations",[],"queries",[64],{"_65":66,"_67":68,"_69":70,"_71":72},"dehydratedAt",1784908508860,"state",{"_74":75,"_76":77,"_78":66,"_79":-5,"_80":26,"_81":26,"_82":26,"_83":-5,"_84":-5,"_85":86,"_35":87,"_88":89},"queryKey",[73,19,14,16],"queryHash","[\"portal\",\"entity\",\"person\",\"person_A5073301367\"]","portal","data",{"_19":20,"_90":91,"_92":93,"_94":95,"_96":97,"_98":99,"_100":101,"_18":102},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount","errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated",false,"success","fetchStatus","idle","entityType","Person","taxonomies",[],"papers",[157,158,159,160,161,162,163,164,165,166],"companies",[103,104,105,106],"events",[],"patents",[],[],{"_15":150,"_29":151,"_31":-5,"_32":152,"_33":-5,"_34":-5,"_35":36,"_37":153,"_39":-5,"_40":41,"_42":154,"_44":155,"_113":143,"_115":-5,"_116":-5,"_117":118,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_125":-5,"_126":-5,"_58":151,"_59":-5},{"_15":137,"_29":138,"_31":-5,"_32":139,"_33":-5,"_34":-5,"_35":36,"_37":140,"_39":-5,"_40":41,"_42":141,"_44":142,"_113":143,"_115":-5,"_116":144,"_117":145,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":146,"_124":-5,"_125":-5,"_126":-5,"_58":138,"_59":-5},{"_15":128,"_29":129,"_31":-5,"_32":130,"_33":-5,"_34":-5,"_35":36,"_37":131,"_39":-5,"_40":41,"_42":132,"_44":133,"_113":114,"_115":-5,"_116":134,"_117":135,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":136,"_124":-5,"_125":-5,"_126":-5,"_58":129,"_59":-5},{"_15":107,"_29":108,"_31":-5,"_32":109,"_33":-5,"_34":-5,"_35":36,"_37":110,"_39":-5,"_40":41,"_42":111,"_44":112,"_113":114,"_115":-5,"_116":-5,"_117":118,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_125":-5,"_126":-5,"_58":108,"_59":-5},"company_I4210114115","IBM Research - Thomas J. Watson Research Center",[108,127],"{\"ror\":\"0265w5591\",\"openalex\":\"I4210114115\"}","2026-05-14T00:28:34.479456863","2026-06-01T05:33:13.80627306","companyType","RESEARCH_INSTITUTE","foundedDate","headquarters","country","US","employeeCount","fundingStage","totalFunding","valuation","website","stockSymbol","uscc","crunchbaseUrl","Thomas J. Watson Research Center","company_I4210103279","IBM Research - India",[129],"{\"openalex\":\"I4210103279\"}","2026-05-14T06:08:08.338008375","2026-05-23T08:26:21.184118403","New Delhi, India","IN","http://www.research.ibm.com/labs/india/","company_I53964585","Weizmann Institute of Science",[147,138,148,149],"{\"ror\":\"0316ej306\",\"openalex\":\"I53964585\"}","2026-05-14T00:48:00.344299954","2026-06-01T04:58:55.333741775","UNIVERSITY","Rehovot, Israel","IL","https://www.weizmann.ac.il","Machon Weizmann LeMada","מכון ויצמן למדע","معهد وايزمان للعلوم","company_I63966007","Massachusetts Institute of Technology",[156,151],"{\"ror\":\"042nb2s44\",\"openalex\":\"I63966007\",\"wikidata\":\"Q49108\"}","2026-05-14T00:28:56.29244562","2026-06-01T04:16:59.964914338","Instituto Tecnológico de Massachusetts",{"_15":292,"_29":293,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":294,"_39":-5,"_40":41,"_42":295,"_44":296,"_172":297,"_174":-5,"_175":298,"_48":293,"_177":-5,"_179":299,"_181":300,"_183":202,"_52":301,"_185":-5,"_186":302,"_188":-5,"_189":86,"_58":293,"_59":-5},{"_15":280,"_29":281,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":282,"_39":-5,"_40":41,"_42":283,"_44":284,"_172":285,"_174":-5,"_175":286,"_48":281,"_177":287,"_179":288,"_181":228,"_183":-5,"_52":289,"_185":-5,"_186":290,"_188":-5,"_189":86,"_58":281,"_59":-5},{"_15":266,"_29":267,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":268,"_39":-5,"_40":41,"_42":269,"_44":270,"_172":271,"_174":-5,"_175":272,"_48":267,"_177":273,"_179":274,"_181":263,"_183":275,"_52":276,"_185":-5,"_186":277,"_188":278,"_189":86,"_58":267,"_59":-5},{"_15":255,"_29":256,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":257,"_39":-5,"_40":41,"_42":258,"_44":259,"_172":260,"_174":-5,"_175":261,"_48":256,"_177":-5,"_179":262,"_181":263,"_183":202,"_52":264,"_185":-5,"_186":265,"_188":-5,"_189":86,"_58":256,"_59":-5},{"_15":244,"_29":245,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":246,"_39":-5,"_40":41,"_42":247,"_44":248,"_172":249,"_174":-5,"_175":250,"_48":245,"_177":-5,"_179":251,"_181":182,"_183":202,"_52":252,"_185":-5,"_186":253,"_188":-5,"_189":86,"_58":245,"_59":-5},{"_15":232,"_29":233,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":234,"_39":-5,"_40":41,"_42":235,"_44":236,"_172":237,"_174":-5,"_175":238,"_48":233,"_177":-5,"_179":239,"_181":240,"_183":202,"_52":241,"_185":-5,"_186":242,"_188":243,"_189":86,"_58":233,"_59":-5},{"_15":220,"_29":221,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":222,"_39":-5,"_40":41,"_42":223,"_44":224,"_172":225,"_174":-5,"_175":226,"_48":221,"_177":-5,"_179":227,"_181":228,"_183":202,"_52":229,"_185":-5,"_186":230,"_188":-5,"_189":86,"_58":221,"_59":-5},{"_15":207,"_29":208,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":209,"_39":-5,"_40":41,"_42":210,"_44":211,"_172":212,"_174":-5,"_175":213,"_48":208,"_177":214,"_179":215,"_181":216,"_183":-5,"_52":217,"_185":-5,"_186":218,"_188":-5,"_189":86,"_58":208,"_59":-5},{"_15":193,"_29":194,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":195,"_39":-5,"_40":41,"_42":196,"_44":197,"_172":198,"_174":-5,"_175":199,"_48":194,"_177":-5,"_179":200,"_181":201,"_183":202,"_52":203,"_185":-5,"_186":204,"_188":-5,"_189":86,"_58":194,"_59":-5},{"_15":167,"_29":168,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":169,"_39":-5,"_40":41,"_42":170,"_44":171,"_172":173,"_174":-5,"_175":176,"_48":168,"_177":178,"_179":180,"_181":182,"_183":-5,"_52":184,"_185":-5,"_186":187,"_188":-5,"_189":86,"_58":168,"_59":-5},"paper_W2020928798","Proofs of ownership in remote storage systems","{\"openalex\":\"W2020928798\",\"doi\":\"10.1145/2046707.2046765\"}","2026-05-15T17:56:00.401498696","2026-05-21T13:01:35.188230525","doi","10.1145/2046707.2046765","arxivId","openalexId","W2020928798","abstractText","Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is deduplication, which stores only a single copy of repeating data. Client-side deduplication attempts to identify deduplication opportunities already at the client and save the bandwidth of uploading copies of existing files to the server. In this work we identify attacks that exploit client-side deduplication, allowing an attacker to gain access to arbitrary-size files of other users based on a very small hash signatures of these files. More specifically, an attacker who knows the hash signature of a file can convince the storage service that it owns that file, hence the server lets the attacker download the entire file. (In parallel to our work, a subset of these attacks were recently introduced in the wild with respect to the Dropbox file synchronization service.) To overcome such attacks, we introduce the notion of proofs-of-ownership (PoWs), which lets a client efficiently prove to a server that that the client holds a file, rather than just some short information about it. We formalize the concept of proof-of-ownership, under rigorous security definitions, and rigorous efficiency requirements of Petabyte scale storage systems. We then present solutions based on Merkle trees and specific encodings, and analyze their security. We implemented one variant of the scheme. Our performance measurements indicate that the scheme incurs only a small overhead compared to naive client-side deduplication.","publishedDate","2011-10-17","publishedYear",2011,"venue",561,"authors","keywords",[190,191,192],"pdfUrl","topVenue","Cloud Data Security Solutions","Cryptography and Data Security","Privacy-Preserving Technologies in Data","paper_W1603068992","A Forward-Secure Public-Key Encryption Scheme","{\"openalex\":\"W1603068992\",\"doi\":\"10.1007/3-540-39200-9_16\"}","2026-05-15T05:46:13.340522462","2026-05-21T04:08:24.189455787","10.1007/3-540-39200-9_16","W1603068992","2003-01-01",2003,"Lecture notes in computer science",685,[191,205,206],"Cryptographic Implementations and Security","Coding theory and cryptography","paper_W2002930326","The random oracle methodology, revisited (preliminary version)","{\"openalex\":\"W2002930326\",\"doi\":\"10.1145/276698.276741\"}","2026-05-15T04:45:07.345329529","2026-05-21T03:22:17.189876484","10.1145/276698.276741","W2002930326","Article The random oracle methodology, revisited (preliminary version) Share on Authors: Ran Canetti IBM Watson, P.O. Box 704, Yorktown Heights, NY IBM Watson, P.O. Box 704, Yorktown Heights, NYView Profile , Oded Goldreich Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel Department of Computer Science, Weizmann Institute of Science, Rehovot, IsraelView Profile , Shai Halevi IBM Watson, P.O. Box 704, Yorktown Heights, NY IBM Watson, P.O. Box 704, Yorktown Heights, NYView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 209–218https://doi.org/10.1145/276698.276741Online:23 May 1998Publication History 403citation694DownloadsMetricsTotal Citations403Total Downloads694Last 12 Months14Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access","1998-01-01",1998,703,[191,219,192],"Complexity and Algorithms in Graphs","paper_W1603256047","Candidate Multilinear Maps from Ideal Lattices","{\"openalex\":\"W1603256047\",\"doi\":\"10.1007/978-3-642-38348-9_1\"}","2026-05-15T02:21:23.47248874","2026-05-21T01:37:47.528537269","10.1007/978-3-642-38348-9_1","W1603256047","2013-01-01",2013,745,[191,219,231],"Geometric and Algebraic Topology","paper_W2401959250","Homomorphic Evaluation of the AES Circuit","{\"openalex\":\"W2401959250\",\"doi\":\"10.1007/978-3-642-32009-5_49\"}","2026-05-15T00:24:50.2289846","2026-05-21T00:09:49.197863409","10.1007/978-3-642-32009-5_49","W2401959250","2012-01-01",2012,781,[191,205,206],"http://link.springer.com/chapter/10.1007%2F978-3-642-32009-5_49","paper_W17575016","Implementing Gentry’s Fully-Homomorphic Encryption Scheme","{\"openalex\":\"W17575016\",\"doi\":\"10.1007/978-3-642-20465-4_9\"}","2026-05-14T17:55:50.460119735","2026-05-21T22:49:58.200785641","10.1007/978-3-642-20465-4_9","W17575016","2011-01-01",895,[191,205,254],"Cryptography and Residue Arithmetic","paper_W2097638666","Chosen-Ciphertext Security from Identity-Based Encryption","{\"openalex\":\"W2097638666\",\"doi\":\"10.1007/978-3-540-24676-3_13\"}","2026-05-14T17:27:18.196976096","2026-05-21T22:02:49.200214715","10.1007/978-3-540-24676-3_13","W2097638666","2004-01-01",2004,908,[191,219,205],"paper_W2152688060","The random oracle methodology, revisited","{\"openalex\":\"W2152688060\",\"doi\":\"10.1145/1008731.1008734\"}","2026-05-14T15:40:00.187049182","2026-05-21T18:54:58.185007841","10.1145/1008731.1008734","W2152688060","We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called \"cryptographic hash functions\".The main result of this article is a negative one: There exist signature and encryption schemes that are secure in the Random Oracle Model, but for which any implementation of the random oracle results in insecure schemes. In the process of devising the above schemes, we consider possible definitions for the notion of a \"good implementation\" of a random oracle, pointing out limitations and challenges.","2004-07-01","Journal of the ACM",966,[191,279,192],"https://open.bu.edu/bitstreams/f0194604-5ba1-4b36-8317-86e1ba5224db/download","Chaos-based Image/Signal Encryption","paper_W2054904172","Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits","{\"openalex\":\"W2054904172\",\"doi\":\"10.1109/focs.2013.13\"}","2026-05-14T11:08:07.226026766","2026-05-21T14:47:20.18286857","10.1109/focs.2013.13","W2054904172","In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C ₀ and C ₁ of similar size, the obfuscations of C ₀ and C ₁ should be computationally indistinguishable. In functional encryption, cipher texts encrypt inputs x and keys are issued for circuits C. Using the key SK _C to decrypt a cipher text CT _x = Enc(x), yields the value C(x) but does not reveal anything else about x. Furthermore, no collusion of secret key holders should be able to learn anything more than the union of what they can each learn individually. We give constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits. We accomplish this goal in three steps: - (1) We describe a candidate construction for indistinguishability obfuscation for NC ¹ circuits. The security of this construction is based on a new algebraic hardness assumption. The candidate and assumption use a simplified variant of multilinear maps, which we call Multilinear Jigsaw Puzzles. (2) We show how to use indistinguishability obfuscation for NC ¹ together with Fully Homomorphic Encryption (with decryption in NC ¹ ) to achieve indistinguishability obfuscation for all circuits. (3) Finally, we show how to use indistinguishability obfuscation for circuits, public-key encryption, and non-interactive zero knowledge to achieve functional encryption for all circuits. The functional encryption scheme we construct also enjoys succinct cipher texts, which enables several other applications.","2013-10-01",1138,[191,205,291],"Internet Traffic Analysis and Secure E-voting","paper_W2156030242","Fully Homomorphic Encryption over the Integers","{\"openalex\":\"W2156030242\",\"doi\":\"10.1007/978-3-642-13190-5_2\"}","2026-05-14T05:04:42.320273896","2026-05-21T07:24:05.315594836","10.1007/978-3-642-13190-5_2","W2156030242","2010-01-01",2010,1861,[191,206,279],{"_60":304,"_62":305},[],[306],{"_65":307,"_67":308,"_69":309,"_71":310},1784908507217,{"_74":312,"_76":77,"_78":307,"_79":-5,"_80":26,"_81":26,"_82":26,"_83":-5,"_84":-5,"_85":86,"_35":87,"_88":89},[73,311],"[\"portal\",\"industries\"]","industries",[313,314,315,316,317,318,319,320,321,322,323,324],{"_15":386,"_29":387,"_31":-5,"_32":388,"_33":389,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":390,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":387,"_59":389},{"_15":382,"_29":383,"_31":-5,"_32":-5,"_33":384,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":385,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":383,"_59":384},{"_15":376,"_29":377,"_31":-5,"_32":378,"_33":379,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":380,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":377,"_59":379},{"_15":372,"_29":373,"_31":-5,"_32":-5,"_33":374,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":375,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":373,"_59":374},{"_15":368,"_29":369,"_31":-5,"_32":-5,"_33":370,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":371,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":369,"_59":370},{"_15":362,"_29":363,"_31":-5,"_32":364,"_33":365,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":366,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":363,"_59":365},{"_15":357,"_29":358,"_31":-5,"_32":-5,"_33":359,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":360,"_337":26,"_338":361,"_339":26,"_340":-5,"_58":358,"_59":359},{"_15":353,"_29":354,"_31":-5,"_32":-5,"_33":355,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":356,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":354,"_59":355},{"_15":349,"_29":350,"_31":-5,"_32":-5,"_33":351,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":352,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":350,"_59":351},{"_15":345,"_29":346,"_31":-5,"_32":-5,"_33":347,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":348,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":346,"_59":347},{"_15":341,"_29":342,"_31":-5,"_32":-5,"_33":343,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":344,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":342,"_59":343},{"_15":325,"_29":326,"_31":-5,"_32":-5,"_33":327,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":328,"_42":-5,"_44":-5,"_329":330,"_331":-5,"_332":77,"_333":334,"_335":336,"_337":26,"_338":86,"_339":26,"_340":-5,"_58":326,"_59":327},"tax_ind_smartphone","智能手机","Smartphone","manual","taxonomyType","INDUSTRY","code","level","parentId","tax_ind_root","path","科技行业/智能手机","sortOrder","isLeaf","entityCount","children","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算",true,"tax_ind_blockchain","区块链",[367],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[381],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[391,392],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_395":24},"SITE_BASE_URL"]

Shai Halevi 人物

Shai Halevi · 相关文章