Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Confidential Content-Based Pub- lish/Subscribe (C-CBPS) is an interaction model that allows parties to exchange content while protecting their security and privacy interests.   advance the state of the art in C-CBPS by showing how all predicate circuits in NC 1 (logarithmic-depth, bounded fan-in) can be confidentially computed by a broker while guaranteeing perfect information-theoretic security. Previous work could handle only strictly shal- lor circuits (e.g. those with depth O( p log 2 n)).  present three protocols—UGP-Match, FSGP-Match and OFSGP-Match—based on 2-decomposable ran- domized encodings of group programs for circuits in NC 1 . UGP-Match is conceptually simple and has a clean proof of correctness but its running time is a polynomial with a high exponent and hence impracti- cal. FSGP-Match uses a "fixed structure" construction that reduces the exponent drastically and achieves ef- ficiency and scalability. OFSGP-Match optimizes the group programs further to shave o a linear factor.
['Rajesh Krishnan', 'Ravi Sundaram']
I am writing a research paper on a idea Secure and scalable match: overcoming the universal circuit bottleneck using group programs
[{"from": "human", "value": "I am writing a research paper on a idea Secure and scalable match: overcoming the universal circuit bottleneck using group programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Confidential Content-Based Pub- lish/Subscribe (C-CBPS) is an interaction model that allows parties to exchange content while protecting their security and privacy interests.   advance the state of the art in C-CBPS by showing how all predicate circuits in NC 1 (logarithmic-depth, bounded fan-in) can be confidentially computed by a broker while guaranteeing perfect information-theoretic security. Previous work could handle only strictly shal- lor circuits (e.g. those with depth O( p log 2 n)).  present three protocols\u2014UGP-Match, FSGP-Match and OFSGP-Match\u2014based on 2-decomposable ran- domized encodings of group programs for circuits in NC 1 . UGP-Match is conceptually simple and has a clean proof of correctness but its running time is a polynomial with a high exponent and hence impracti- cal. FSGP-Match uses a \"fixed structure\" construction that reduces the exponent drastically and achieves ef- ficiency and scalability. OFSGP-Match optimizes the group programs further to shave o a linear factor."}]