Sciweavers

105 search results - page 14 / 21
» Simple, Black-Box Constructions of Adaptively Secure Protoco...
Sort
View
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
15 years 3 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
15 years 4 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong
ASIACRYPT
2007
Springer
15 years 3 months ago
Bounded CCA2-Secure Encryption
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, ...
62
Voted
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 3 months ago
Perfect NIZK with Adaptive Soundness
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
Masayuki Abe, Serge Fehr
IACR
2011
94views more  IACR 2011»
13 years 9 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin