a structured multisignature scheme from the gap diffie

Curriculum Vitae Yvo Desmedt

1 Curriculum Vitae Yvo Desmedt 1 Personal Details Name: Present appointments: Yvo Desmedt Jonsson Distinguished Professor Department of Computer Science The University of Texas at Dallas USA Date of appointment: August 2012 Chair of Information Communication Technology (Courtesy) Computer Science University College London UK Date of appointment: August Education Dates Detail of

Information Security and Privacy 4 conf ACISP'99

After that both mobile station and base station compute a shared session key using Diffie-Hellman key exchange scheme Beller and Yacobi's protocol Beller and Yacobi designed a protocol that uses ElGamal algorithm (from now on we call it BY) and afterwards Boyd and Mathuria showed that this protocol is vulnerable to a man-in-the-middle attack and improved it [4]

Cryptology ePrint Archive: Report 2003/090

A Structured Multisignature Scheme from the Gap Diffie-Hellman Group Chih-Yin Lin and Tzong-Chen Wu and Fangguo Zhang Abstract: In this paper the authors propose a new structured multisignature scheme that considers the signing order among co-signers

Reference List of Indexed Articles

Information Processing Letters 78 (2001) 337–448 Reference List of Indexed Articles This Reference List of Indexed Articles belongs to the Subject Index Volumes 1–75 (pp 5–336 of this issue) 1 G M Stacey The role of virtual memory in the handling of application files 1 (1) (1971) 1–3 2 F G Duncan and D Zissos Programmed simulation of sequential circuits 1 (1) (1971) 4–6

Information Security and Privacy 7 conf ACISP 2002

( v1 v 2 ) e mod n = α If both conditions hold then CAi is convinced that the user has correctly deposited his private key di share and that the user's public key matches his private key 2 2 Certificate Generation In this second phase the CAs collaboratively generate a certificate for the user's public key m = (n e CA1 v1 CA2 v2) using the multisignature scheme presented in [KL94]

Alexandra Boldyreva

Efficient threshold signature multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme PKC 2003 LNCS 2139 A Boldyreva Springer-Verlag 2003 80: 2003: A closer look at PKI: Security and efficiency A Boldyreva M Fischlin A Palacio B Warinschi

ENTITY

A method for processing an operating computer file (100) of an equipment item installed on board an aircraft (110) the method comprising the digital signature of the said computer file by means of a least one first private key (124 124') the said first private key being generated according to a scheme based on the identity (122 122') of a first entity (120 120')

ICEIS 2005 International Conference on Enterprise

International Conference on Enterprise Information Systems Main Topic Areas: Databases and Information Systems Integration Artificial Intelligence and Decision Support Systems Information Systems Analysis and Specification Software Agents and

International Journal Papers

Chang C C and Liou F Y (1994): A Digital Multisignature Scheme Based upon the Digital C C (2010): A Key Management Scheme for Sensor Networks Using Bilinear Pairings and Gap Diffie-Hellman Group International Journal of Innovative Computing Information and Control Vol 6 No 2 Feb 2010 pp 809-816 Yang J H and Chang C C (2009): An Efficient Three-party

International Journal of Electronic Security and Digital

Abstract: In order to deal with key exposure problem we introduce forward secure technique into certificateless proxy multisignature scheme and give the formal definition and security model of forward secure certificateless proxy multisignature Furthermore we present a construction of forward secure certificateless proxy multi-signature scheme Based on the difficulty of computational Diffie

Lecture Notes in Computer Science

Lecture Notes in Computer Science Volume 1357 1998 Simon Znaty and Jean-Pierre Hubaux I: Object-Oriented Technology for Telecommunications Services Engineering 1 Simon Znaty and Jean-Pierre Hubaux Telecommunications Services Engineering: Principles Architectures and Tools 3 Arve Meisingset Difficulties with Mapping OMT Specifications into GDMO

Curriculum Vitae Yvo Desmedt

1 Curriculum Vitae Yvo Desmedt 1 Personal Details Name: Present appointments: Yvo Desmedt Jonsson Distinguished Professor Department of Computer Science The University of Texas at Dallas USA Date of appointment: August 2012 Chair of Information Communication Technology (Courtesy) Computer Science University College London UK Date of appointment: August Education Dates Detail of

Public Key Cryptography: Third International Workshop on

This book constitutes the refereed proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography PKC 2000 held in Melbourne Victoria Australia in January 2000 The 31 revised full papers presented were carefully reviewed and selected from 70 submissions Among the topics addressed are cryptographic protocols digital signature schemes elliptic curve

Mobile Ad

on a Cooperative Caching Scheme for Mobile Ad Hoc Networks 265 F J Gonzalez-Caete and E Casilari Applications of Ad Hoc Networks 287 Ad Hoc Networks for Cooperative Mobile Positioning 289 Francescantonio Della Rosa Helena Leppkoski Ata-ul Ghalib Leyla Ghazanfari Oscar Garcia Simone Frattasi and Jari Nurmi Ad-hoc Networks

A Structured Aggregate Signature Scheme with Pairing-based Cryptography （） 2013/01: 33 Digital Signature Scheme Enabling Pre-control of Content Editing for Secondary Use （） 2013/01: 34 A New Tree-structure-specified Multisignature Scheme for a Document Circulation System （） 2011/07: 35 Anonymous handover mechanism for service mobility in

Science of Security (SoS) Newsletter (2015

We provide two versions of our scheme: the first one is based on the conventional NTRU encryption scheme and although it lacks a security proof remains as efficient as its predecessor the second one is based on a variant of NTRU proposed by Stehl and Steinfeld which is proven CPA-secure under the hardness of the Ring-LWE problem To the best of our knowledge our proposals are the first

A Touch of Evil: High

Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme InPublic Key Cryptography - PKC 2003 31–46 [22] Julia Borghoff Anne Canteaut Tim Gneysu Elif Bilge Kavun Miroslav Kneze-vic Lars R Knudsen Gregor Leander Ventzislav Nikov Christof Paar Christian Rechberger et al 2012

A Structured Multisignature Scheme from the Gap Diffie

Moreover the size and the verification of a structured multisignature is the same as those of an individual signature generated by any co-signer Arithmetically the proposed scheme makes use of the Gap Diffie-Hellman (GDH) signature scheme recently presented by Boneh Shacham and Lynn

IEICE Trans

Meeting Tight Security for Multisignatures in the Plain Public Key Model Naoto YANAI : Publication: Publication Date: 2018/09/01 Vol E101-A No 9 pp 1484-1493 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category:

Lecture Notes in Computer Science

Lecture Notes in Computer Science Volume 2370 2002 Anne-Franoise Le Meur and Charles Consel and Beno^it Escrig An Environment for Building Customizable Software Components 1 Nicolas Le Sommer and Frdric Guidec A Contract-Based Approach of Resource-Constrained Software Deployment 15 Marija Mikic-Rakic and Nenad Medvidovic Architecture-Level Support for Software

Paper

In contrast to the only prior scheme to provide this functionality ours offers improved security that does not rely on synchronized clocks or a trusted first signer We provide formal security definitions and support the proposed schemes with security proofs under appropriate computational assumptions

Group Diffie

It is Group Diffie-Hellman Group Diffie-Hellman listed as GDH Group Diffie-Hellman - How is Group Diffie-Hellman abbreviated Gap Diffie Hellman: GDH: General Data Handler: STR uses unbalanced key tree for group key computation tree-based group Diffie-Hellman (TGDH) leverages balanced tree structure Secure collaborative key

IEICE Trans

Meeting Tight Security for Multisignatures in the Plain Public Key Model Naoto YANAI : Publication: Publication Date: 2018/09/01 Vol E101-A No 9 pp 1484-1493 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category:

2010 International Conference on Communications and

artykuł: RouteGuard: A Trust-Based Scheme for Guarding Routing in Structured Peer-to-Peer Overlays (Guowei Huang G Jiangang Chen J Lian Wei L ) s 330 - 334 artykuł: A Method of Representing Videos Based on User Interest Model in Mobile Multimedia Service ( Xiang Li X Yang Deng Y Wendong Wang W Zou Yanming Z Wang Kongqiao W ) s 335 - 339

SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE

SCHEME OF INSTRUCTION EXAMINATION (Regulation R16) III/IV B TECH (With effect from 2016-2017 Admitted Batch onwards) Under Choice Based Credit System CIVIL ENGINEERING I-SEMESTER #ELE-I B16 CE 3106 Concrete Technology B16 CE 3107 GIS Remote Sensing B16 CE 3108 Pre Stressed Concrete B16 CE 3109 Building Services and Maintenance

Information Security and Privacy 7 conf ACISP 2002

CAi has a private key xi and a corresponding public key yi in the multisignature scheme where xi is randomly selected from GF(P) and where y i = G xi mod P The collective public key of the two CAs is y =y1y2 mod P To generate a certificate for the user's public key CAi computes ri = G ki mod P and sends it to the other CA where ki is a random element from GF(P) and kept secret Each CAi

Aggregate and Veri ably Encrypted Signatures from Bilinear

This signature scheme works in any group where the Decision Di e-Hellman problem (DDH) is easy but the Computational Di e-Hellman problem (CDH) is hard We refer to such groups as gap groups [6 26] Recently there have been a number of constructions using such gap groups [6 19 8 4] Surprisingly general gap groups are insu cient for