Sciweavers

658 search results - page 131 / 132
» The Grindahl Hash Functions
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
13 years 10 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...
GLOBECOM
2008
IEEE
13 years 8 months ago
Evaluating P2PSIP under Attack: An Emulative Study
— Recently, establishing a VoIP call using a P2P network instead of regular SIP-servers has been proposed; this novel approach to SIP-signaling is commonly referred to as P2PSIP ...
Jan Seedorf, Frank Ruwolt, Martin Stiemerling, Sav...
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
13 years 7 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
CN
2007
144views more  CN 2007»
13 years 7 months ago
SPP: An anti-phishing single password protocol
Most users have multiple accounts on the Internet where each account is protected by a password. To avoid the headache in remembering and managing a long list of different and un...
Mohamed G. Gouda, Alex X. Liu, Lok M. Leung, Moham...