Sciweavers

783 search results - page 14 / 157
» On security proof of McCullagh
Sort
View
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
14 years 3 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
EUROCRYPT
2008
Springer
13 years 11 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
PERVASIVE
2006
Springer
13 years 9 months ago
Scalability in a Secure Distributed Proof System
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
Kazuhiro Minami, David Kotz
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 9 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
14 years 3 months ago
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
Jonathan Katz, Yehuda Lindell