Sciweavers

610 search results - page 42 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
CSFW
2006
IEEE
15 years 5 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
SP
2006
IEEE
143views Security Privacy» more  SP 2006»
15 years 5 months ago
Cognitive Authentication Schemes Safe Against Spyware (Short Paper)
Can we secure user authentication against eavesdropping adversaries, relying on human cognitive functions alone, unassisted by any external computational device? To accomplish thi...
Daphna Weinshall
MA
2001
Springer
98views Communications» more  MA 2001»
15 years 4 months ago
On the Robustness of Some Cryptographic Protocols for Mobile Agent Protection
Mobile agent security is still a young discipline and most naturally, the focus up to the time of writing was on inventing new cryptographic protocols for securing various aspects ...
Volker Roth
CCS
2009
ACM
15 years 6 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
JUCS
2008
149views more  JUCS 2008»
14 years 11 months ago
Formal Security Definition and Efficient Construction for Roaming with a Privacy-Preserving Extension
: In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages ex...
Guomin Yang, Duncan S. Wong, Xiaotie Deng