Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(8)
Building Block
Group Signature
Interactive Proofs
Provable Security
Public Key Certificate
Random Oracle
Random Oracle Model
Standard Model
Subscribe
Academic
Publications
Group Encryption: Noninteractive Realization in the Standard Model
Group Encryption: Noninteractive Realization in the Standard Model,10.1007/9783642103667_11,Julien Cathalo,Benoît Libert,Moti Yung
Edit
Group Encryption: Noninteractive Realization in the Standard Model
(
Citations: 5
)
BibTex

RIS

RefWorks
Download
Julien Cathalo
,
Benoît Libert
,
Moti Yung
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encrypt a message (in the CCA2 security sense) for some member of a PKI group concealing that member’s identity (in a CCA2 security sense, as well); the sender is able to convince a verifier that, among other things, the ciphertext is valid and some anonymous certified group member will be able to decrypt the message. As in group signatures, an opening authority has the power of pinning down the receiver’s identity. The initial GE construction uses
interactive proofs
as part of the design (which can be made noninteractive using the
random oracle
model) and the design of a fully noninteractive group encryption system is still an open problem. In this paper, we give the first GE scheme, which is a pure encryption scheme in the standard model, i.e., a scheme where the ciphertext is a single message and proofs are noninteractive (and do not employ the
random oracle
heuristic). As a building block, we use a new
public key
certification scheme which incurs the smallest amount of interaction, as well.
Conference:
International Conference on the Theory and Application of Cryptology and Information Security  ASIACRYPT
, pp. 179196, 2009
DOI:
10.1007/9783642103667_11
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
More »
Citation Context
(4)
...crypted signatures [BGLS03, RS09], noninteractive group encryption [
CLY09
] and many more...
...Independently of our work, Cathalo, Libert and Yung [
CLY09
] gave a practical scheme based on a combination of the hidden strong DiffieHellman assumption, StructurePreserving Signatures and Commitments to Group Elements 215...
...The 2outof3 CDH assumption [KP06] states that given (G, G a ,H ), it is hard to output (G r ,H ar ) for an arbitrary r � . To break theFlexible CDH assumption [LV08,
CLY09
], an adversary must additionally compute G ar .W e further weaken the assumption by defining a solution as (G r ,G ar ,H r ,H ar ), and gener...
Masayuki Abe
,
et al.
StructurePreserving Signatures and Commitments to Group Elements
...In contrast, group signature scheme with concurrent join has been proposed in [39] and can also be constructed based on group encryption [
22
]...
Man Ho Au
,
et al.
ProofofKnowledge of Representation of Committed Value and Its Applic...
...Structurepreserving signature schemes [8,5,
3
,2,1] allow to sign group elements as a message without applying a hash function and prove one’s possession of a...
...even unbounded. For instance, for the schemes in [8,
3
,2], a verificationkey is inherently larger than the message space...
...Case 1 (k ≥ 3). When the basic scheme Σ k can sign 3 group elements or more, like the ones in [8,
3
,2], one can sign arbitrary number of group elements by first generating random onetime tag t ∈ G and computing...
Masayuki Abe
,
et al.
Efficient Message Space Extension for Automorphic Signatures
...Cathalo, Libert and Yung [
CLY09
] constructed a partially structurepreserving signature scheme which signs only a single group element and used it for the construction of a groupencryption scheme...
Masayuki Abe
,
et al.
Optimal StructurePreserving Signatures in Asymmetric Bilinear Groups
References
(39)
On the Security of Joint Signature and Encryption
(
Citations: 219
)
Jee Hea An
,
Yevgeniy Dodis
,
Tal Rabin
Conference:
Theory and Application of Cryptographic Techniques  EUROCRYPT
, pp. 83107, 2002
Psignatures and Noninteractive Anonymous Credentials
(
Citations: 28
)
Mira Belenkiy
,
Melissa Chase
,
Markulf Kohlweiss
,
Anna Lysyanskaya
Conference:
Theory of Cryptography
, pp. 356374, 2008
KeyPrivacy in PublicKey Encryption
(
Citations: 140
)
Mihir Bellare
,
Alexandra Boldyreva
,
Anand Desai
,
David Pointcheval
Conference:
International Conference on the Theory and Application of Cryptology and Information Security  ASIACRYPT
, pp. 566582, 2001
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
(
Citations: 1342
)
Mihir Bellare
,
Phillip Rogaway
Conference:
ACM Conference on Computer and Communications Security  CCS
, 1995
A Closer Look at PKI: Security and Efficiency
(
Citations: 12
)
Alexandra Boldyreva
,
Marc Fischlin
,
Adriana Palacio
,
Bogdan Warinschi
Conference:
Public Key Cryptography  PKC
, pp. 458475, 2007
Sort by:
Citations
(5)
StructurePreserving Signatures and Commitments to Group Elements
(
Citations: 13
)
Masayuki Abe
,
Georg Fuchsbauer
,
Jens Groth
,
Kristiyan Haralambiev
,
Miyako Ohkubo
Conference:
International Crytology Conference  CRYPTO
, pp. 209236, 2010
ProofofKnowledge of Representation of Committed Value and Its Applications
(
Citations: 1
)
Man Ho Au
,
Willy Susilo
,
Yi Mu
Conference:
Australasian Conference on Information Security and Privacy  ACISP
, pp. 352369, 2010
Efficient Message Space Extension for Automorphic Signatures
Masayuki Abe
,
Kristiyan Haralambiev
,
Miyako Ohkubo
Conference:
Information Security Conference/Information Security Workshop  ISC(ISW)
, pp. 319330, 2010
Signing on Elements in Bilinear Groups for Modular Protocol Design
(
Citations: 5
)
Masayuki Abe
,
Kristiyan Haralambiev
,
Miyako Ohkubo
Optimal StructurePreserving Signatures in Asymmetric Bilinear Groups
Masayuki Abe
,
Jens Groth
,
Kristiyan Haralambiev
,
Miyako Ohkubo