Sciweavers

610 search results - page 70 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
CSFW
2008
IEEE
15 years 6 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
ICALP
2009
Springer
16 years 4 days ago
Secure Function Collection with Sublinear Storage
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong...
CTRSA
2007
Springer
93views Cryptology» more  CTRSA 2007»
15 years 3 months ago
Human Identification Through Image Evaluation Using Secret Predicates
Abstract. The task of developing protocols for humans to securely authenticate themselves to a remote server has been an interesting topic in cryptography as a replacement for the ...
Hassan Jameel, Riaz Ahmed Shaikh, Heejo Lee, Sungy...
NORDSEC
2009
Springer
15 years 4 months ago
Formal Analysis of the Estonian Mobile-ID Protocol
In this paper, we report the results of the formal analysis performed on the Estonian Mobile-ID protocol (deployed since 2008), allowing citizens and permanent residents of Estonia...
Peeter Laud, Meelis Roos
GI
2010
Springer
14 years 10 months ago
Finite System Composition and Interaction
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...
Johannes Reich