Sciweavers

1064 search results - page 92 / 213
» Cryptography from Anonymity
Sort
View
CONCUR
2003
Springer
15 years 9 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
AAECC
2005
Springer
104views Algorithms» more  AAECC 2005»
15 years 3 months ago
Isomorphism Classes of Picard Curves over Finite Fields
In this paper we determine the number of isomorphism classes of Picard curves, i.e., superelliptic curves y3 = f(x) of genus three, over finite fields of characteristic different f...
Jong Won Lee
RFIDSEC
2010
15 years 1 months ago
Tree-Based RFID Authentication Protocols Are Definitively Not Privacy-Friendly
Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensu...
Gildas Avoine, Benjamin Martin 0002, Tania Martin
189
Voted
BIOSIG
2009
136views Biometrics» more  BIOSIG 2009»
15 years 1 months ago
Tamper-proof and Privacy-protected Fingerprint Identification Systems
: In this paper alternatives of tamper-proof and privacy-protected biometric identification systems are shown. One approach to secure such databases is to use cryptography. With it...
Michael Schwaiger
WWW
2008
ACM
16 years 4 months ago
Planetary-scale views on a large instant-messaging network
We present a study of anonymized data capturing a month of high-level communication activities within the whole of the Microsoft Messenger instant-messaging system. We examine cha...
Jure Leskovec, Eric Horvitz