1777 search results - page 126 / 356 » Programming Cryptographic Protocols |
125
click to vote
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
137
click to vote
IACR
2011
14 years 27 days ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
209
click to vote
POPL
2005
ACM
16 years 1 months ago
2005
ACM
We present PEAR (Protocol Extendable AnalyzeR), a tool automating the two static analyses for authentication protocols presented in [7, 8]. These analyses are based on a tagging s...
IFIP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We analyse the C anonymity protocol under the novel assumption that the attacker has independent knowledge on behavioural patterns of individual users. Und...
103
click to vote
ISW
2004
Springer
15 years 6 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...