Sciweavers

285 search results - page 29 / 57
» Computationally Sound, Automated Proofs for Security Protoco...
Sort
View
FCS
2006
13 years 9 months ago
Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
Song Y. Yan, Glyn James, Gongyi Wu
CCR
2000
101views more  CCR 2000»
13 years 7 months ago
Knowledge-proof based versatile smart card verification protocol
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
Dae Hun Nyang, Joo-Seok Song
FOCS
2009
IEEE
14 years 2 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner
EUROCRYPT
1999
Springer
13 years 12 months ago
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Distributed key generation is a main component of threshold cryptosystems and distributed cryptographic computing in general. Solutions to the distributed generation of private key...
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk,...
IEEESCC
2006
IEEE
14 years 1 months ago
Secure and Provable Service Support for Human-Intensive Real-Estate Processes
This paper introduces SOAR, a service-oriented architecture for the real-estate industry that embeds trust and security, allows for formal correctness proofs of service interactio...
Emerson Ribeiro de Mello, Savas Parastatidis, Phil...