849 search results - page 82 / 170 » Completely Non-malleable Schemes |
124
click to vote
ICDAR
2011
IEEE
14 years 7 days ago
2011
IEEE
—Retrieval from Hindi document image collections is a challenging task. This is partly due to the complexity of the script, which has more than 800 unique ligatures. In addition,...
103
Voted
STOC
2007
ACM
16 years 28 days ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
103
Voted
TCC
2010
Springer
15 years 7 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
ICRA
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— This paper presents ICS-AVOID, a collision avoidance scheme based upon the concept of Inevitable Collision State (ICS), ie a state for which, no matter what the future ...
109
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...