Sciweavers

352 search results - page 21 / 71
» Cryptography in the Multi-string Model
Sort
View
ASIACRYPT
2008
Springer
13 years 12 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
ACNS
2009
Springer
158views Cryptology» more  ACNS 2009»
14 years 4 months ago
A New Variant of the Cramer-Shoup KEM Secure against Chosen Ciphertext Attack
We propose a new variant of the Cramer-Shoup KEM (key encapsulation mechanism). The proposed variant is more efficient than the original Cramer-Shoup KEM scheme in terms of public...
Joonsang Baek, Willy Susilo, Joseph K. Liu, Jianyi...
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
14 years 4 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
14 years 3 months ago
Public-Key Steganography with Active Attacks
A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CC...
Michael Backes, Christian Cachin
BPM
2003
Springer
75views Business» more  BPM 2003»
14 years 3 months ago
Security in Business Process Engineering
We present a general methodology for integrating arbitrary security requirements in the development of business processes in a both elegant and rigorous way. We show how trust rela...
Michael Backes, Birgit Pfitzmann, Michael Waidner