Sciweavers

44 search results - page 6 / 9
» Additive Proofs of Knowledge - A New Notion for Non-Interact...
Sort
View
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
FMCAD
2007
Springer
14 years 1 months ago
Induction in CEGAR for Detecting Counterexamples
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
Chao Wang, Aarti Gupta, Franjo Ivancic
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 7 months ago
Multi-Agent Only Knowing
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Joseph Y. Halpern, Gerhard Lakemeyer
TCOS
2010
13 years 2 months ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan
EUROCRYPT
2003
Springer
14 years 25 days ago
A Framework for Password-Based Authenticated Key Exchange
Abstract. In this paper we present a general framework for passwordbased authenticated key exchange protocols, in the common reference odel. Our protocol is actually an abstraction...
Rosario Gennaro, Yehuda Lindell