Sciweavers

38 search results - page 2 / 8
» Computationally sound analysis of protocols using bilinear p...
Sort
View
IACR
2011
152views more  IACR 2011»
12 years 5 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
CCS
2009
ACM
14 years 17 days ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
IJNSEC
2010
91views more  IJNSEC 2010»
13 years 18 days ago
An Improvement on a Three-party Password-based Key Exchange Protocol Using Weil Pairing
The three-party password-based key exchange protocols using Weil pairing proposed by Wen is vulnerable to impersonation attack. By introducing hard artificial intelligence problem...
Yong Zeng, Jianfeng Ma, Sang-Jae Moon
CG
2011
Springer
13 years 23 days ago
Multiresolutions numerically from subdivisions
In previous work we introduced a construction to produce multiresolutions from given subdivisions. A portion of that construction required solving bilinear equations using a symbo...
Richard H. Bartels, Faramarz Samavati
MOBISYS
2005
ACM
14 years 5 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf