2108 search results - page 313 / 422 » Encrypted |
127
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
145
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
110
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
206
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
In an outsourced data framework, we introduce and demonstrate mechanisms for securely storing a set of data items (documents) on an un-trusted server, while allowing for subsequen...
207
click to vote
VLDB
2009
ACM
16 years 2 months ago
2009
ACM
This paper answers the following question; given a multiplicity of evolving 1-way conversations, can a machine or an algorithm discern the conversational pairs in an online fashio...