773 search results - page 39 / 155 » On Cryptographic Assumptions and Challenges |
122
click to vote
EUROCRYPT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...
104
click to vote
IH
1998
Springer
15 years 6 months ago
1998
Springer
Many eligibility or entitlement certificates in every day life are non-transferable between persons. However, they are usually implemented by personal physical tokens that owners c...
107
click to vote
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
138
click to vote
CTRSA
2008
Springer
15 years 3 months ago
2008
Springer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
107
click to vote
ICISC
2009
14 years 11 months ago
2009
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...