shareengineer: Breaking the O(n1=(2k􀀀1)) Barrier forInformation-Theoretic Private Information Retrieval

Monday, September 17, 2012

Breaking the O(n1=(2k􀀀1)) Barrier forInformation-Theoretic Private Information Retrieval

Breaking the O(n1=(2k􀀀1))BarrierforInformation-Theoretic Private InformationRetrieval(direct ref..)

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)