{"id":"W2407643022","doi":"","title":"How to Compress (Reusable) Garbled Circuits.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Ciphertext; IBM; Key (lock); Computer science; Encryption; Homomorphic encryption; Learning with errors; Electronic circuit; Multilinear map; Scheme (mathematics); Functional encryption; Multiplicative function; Boolean circuit; Theoretical computer science; Security parameter; Arithmetic; Algorithm; Mathematics; Computer network; Logic gate; Computer security; Electrical engineering; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037775,0.001402299,0.001664154,0.001174235,0.001099262,0.003705427,0.002243826,0.002417342,0.0123165],"category_scores_gemma":[0.03578157,0.0008042714,0.001606654,0.001566323,0.002995139,0.01957505,0.00444811,0.004007993,0.003413463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001822224,"about_ca_system_score_gemma":0.001585388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004508701,"about_ca_topic_score_gemma":0.000415783,"domain_scores_codex":[0.9960376,0.0009118653,0.0003546854,0.0008667641,0.001354187,0.0004749142],"domain_scores_gemma":[0.9799682,0.00882384,0.001284794,0.008347494,0.001177239,0.0003984649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000870903,0.000149159,0.001295705,0.001124005,0.0001381275,0.0003461713,0.0007719198,0.06314105,0.02411002,0.7167602,0.007232237,0.1840605],"study_design_scores_gemma":[0.0001074079,0.0003059913,0.0002594689,0.0003153967,0.0001064351,0.0006161918,0.0002207766,0.08280316,0.0345834,0.8558099,0.02479556,0.00007625695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05846735,0.002157927,0.9163908,0.003704951,0.0004325634,0.0004594371,0.0007789967,0.003314016,0.01429383],"genre_scores_gemma":[0.6593477,0.002599755,0.3167165,0.00165565,0.0004036741,0.0009572024,0.001417439,0.001246414,0.01565568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0123165,"threshold_uncertainty_score":0.04120278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02216625853187726,"score_gpt":0.2505621489034478,"score_spread":0.2283958903715705,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}