UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Structure-Preserving Signatures and Commitments to Group Elements
  • Publication Type:
    Conference
  • Authors:
    Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M
  • Publisher:
    Springer
  • Publication date:
    2010
  • Pagination:
    209, 236
  • Volume:
    6223
  • Series:
    Lecture Notes in Computer Science
  • Editors:
    Rabin T
  • ISBN-13:
    978-3-642-14622-0
  • Name of conference:
    Advances in Cryptology - CRYPTO: 30th Annual International Cryptology Conference
  • Conference place:
    Santa Barbara, US
  • Conference start date:
    15/08/2010
  • Conference finish date:
    19/08/2010
  • Print ISSN:
    0302-9743
  • Language:
    EN
  • Keywords:
    SIZE GROUP SIGNATURES, RANDOM ORACLES, BLIND SIGNATURES, ANONYMOUS CREDENTIALS, BILINEAR GROUPS, OBLIVIOUS TRANSFER, SECURITY, SCHEME, ASSUMPTIONS, PROOFS
Abstract
A modular approach for cryptographic protocols leads to a simple design but often inefficient constructions. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest structure-preserving commitments and signatures to overcome this dilemma and provide a way to construct modular protocols with reasonable efficiency, while retaining conceptual simplicity.We focus on schemes in bilinear groups that preserve parts of the group structure, which makes it easy to combine them with other primitives such as non-interactive zero-knowledge proofs for bilinear groups.We say that a signature scheme is structure-preseroing if its verification keys, signatures, and messages are elements in a bilinear group, and the verification equation is a conjunction of pairing-product equations. If moreover the verification keys lie in the message space, we call them automorphic. We present several efficient instantiations of automorphic and structure-preserving signatures, enjoying various other additional properties, such as simulatability. Among many applications, we give three examples: adaptively secure round-optimal blind signature schemes, a group signature scheme with efficient concurrent join, and an efficient instantiation of anonymous proxy signatures.A further contribution is homomorphic trapdoor commitments to group elements which are also length reducing. In contrast, the messages of previous homomorphic trapdoor commitment schemes are exponents.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by