319 search results - page 22 / 64 » Cryptographic Assumptions: A Position Paper |
80
Voted
EUROCRYPT
2000
Springer
15 years 1 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...
CTRSA
2008
Springer
14 years 11 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...
108
click to vote
IACR
2011
13 years 9 months ago
2011
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
ISW
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
101
click to vote
IANDC
2008
14 years 9 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...