Filters








13,673 Hits in 3.7 sec

Multi-Designated Verifiers Signatures Revisited

Sherman S. M. Chow
2008 International Journal of Network Security  
Multi-Designated Verifier Signatures (MDVS) are privacy-oriented signatures that can only be verified by a set of users specified by the signer.  ...  We propose two new generic constructions of MDVS from variants of existing cryptographic schemes, which are ring signature from anonymous subset and multi-chameleon hash.  ...  We leave it as an open problem to devise other (generic) constructions of multi-designated verifiers signature and other multi-chameleon hash function.  ... 
dblp:journals/ijnsec/Chow08 fatcat:kdhnqwmy7bdetmiehp2ubx5ieq

(Strong) multidesignated verifiers signatures secure against rogue key attack

Man Ho Au, Guomin Yang, Willy Susilo, Yunmei Zhang
2013 Concurrency and Computation  
(STRONG) MULTI-DESIGNATED VERIFIERS SIGNATURES SECURE AGAINST ROGUE KEY ATTACK 7 § We abuse the notation and assume a full domain hash.  ...  Multi-designated verifiers signatures (MDVS) are a natural extension of DVS in which the signer can choose multiple designated verifiers.  ...  Strong Multi-Designated Verifiers Signatures Strong Multi-Designated Verifiers Signatures.  ... 
doi:10.1002/cpe.3094 fatcat:4cilfw2jgrcprmhsrl66yfd7jq

Multi-designated Verifiers Signatures [chapter]

Fabien Laguillaumie, Damien Vergnaud
2004 Lecture Notes in Computer Science  
In this article, we provide a formal definition of multi-designated verifiers signatures and give a rigorous treatment of the security model for such a scheme.  ...  Designated verifier signatures were introduced in the middle of the 90's by Jakobsson, Sako and Impagliazzo, and independenty patended by Chaum as private signatures.  ...  Final Remarks and Conclusion. We formally defined the new multi-designated verifiers signature primitive (suggested by Desmedt in [8] ) and its security model.  ... 
doi:10.1007/978-3-540-30191-2_38 fatcat:nv7ik7ngejdsxmvjwztzs4cuvm

Ambiguous optimistic fair exchange: Definition and constructions

Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
2015 Theoretical Computer Science  
We present a formal security model for AOFE in the multi-user setting and chosen-key model, and propose a generic construction of AOFE that is provably secure under our model.  ...  We present a formal security model for AOFE in the multi-user setting and chosen-key model, and propose a generic construction of AOFE that is provably secure under our model.  ...  $ A preliminary version of this paper appeared in Asiacrypt 2008 [25] . This is a vastly extended version. This work is supported by the National Natural  ... 
doi:10.1016/j.tcs.2014.09.043 fatcat:gbbutkwh3vg6dhcziyzwk6evjm

IoT-REX: A Secure Remote-Control System for IoT Devices from Centralized Multi-Designated Verifier Signatures [article]

Yohei Watanabe, Naoto Yanai, Junji Shikata
2022 arXiv   pre-print
Towards realizing IoT-REX, we introduce a novel cryptographic primitive called centralized multi-designated verifier signatures (CMDVS).  ...  We provide an efficient CMDVS construction from any approximate membership query structures and digital signatures, yielding compact communication sizes and efficient verification procedures for IoT-REX  ...  This research was conducted under a contract of "Research and development on IoT malware removal / make it non-functional technologies for effective use of the radio spectrum" among "Research and Development  ... 
arXiv:2208.03781v1 fatcat:3qqllio5kfavnpk5cdp33yxczm

Malleability and ownership of proxy signatures: Towards a stronger definition and its limitations

Sanjit Chatterjee, ,Department of Computer Science and Automation, Indian Institute of Science, India, Berkant Ustaoğlu, ,Izmir Institute of Technology, Urla, Izmir, 35430 Turkey
2019 Advances in Mathematics of Communications  
Noticing the ad-hoc nature of security analysis prevalent in the existing literature, Boldyreva, Palacio and Warinschi proposed a formal security model for proxy signature.  ...  We propose a stronger definition of proxy signature to address these issues.  ...  Outline of the paper. In §2 we argue for a stronger security definition of proxy signatures through some plausible attack scenarios on the delegation-bycertificate construction of [7] .  ... 
doi:10.3934/amc.2020015 fatcat:s5dw2ms6zzgzbnrfyvlmyx5ie4

Revisiting Post-Compromise Security Guarantees in Group Messaging [article]

Cas Cremers, Britta Hale, Konrad Kohbrok
2019 IACR Cryptology ePrint Archive  
We map the design space of healing mechanisms, analyzing security and overhead of possible solutions.  ...  We provide a security definition for post-compromise secure signatures and an instantiation.  ...  Let ν = (Gen, Sign, Verify) be an EUF-CMA-secure signature scheme with adversarial advantage function EUF-CMA , and µ = (Gen, Sign, Verify, Update, RecvUpdate) constructed as in Construction 1.  ... 
dblp:journals/iacr/CremersHK19 fatcat:73gsyra7ezgwrlikkdpdcnmiiq

Stronger Notions and Constructions for Multi-Designated Verifier Signatures [article]

Ivan Damgård, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov
2019 IACR Cryptology ePrint Archive  
To achieve these properties it is natural to consider Multi-Designated Verifier Signatures (MDVS), which intuitively seem to target exactly the properties we require.  ...  The contributions of this paper are two-fold: stronger definitions for MDVS, and new constructions meeting those definitions.  ...  Multi-Designated Verifier Signatures MDVS Algorithms A multi-designated verifier signature (MDVS) scheme is defined by the following probabilistic polynomial-time algorithms: Setup(1 κ ) → (pp, msk): On  ... 
dblp:journals/iacr/DamgardHMNOY19 fatcat:7qmfbc625zhpzovk75u5g7u46m

Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting [chapter]

Xinyi Huang, Yi Mu, Willy Susilo, Wei Wu, Yang Xiang
2010 Lecture Notes in Computer Science  
Finally we provide a new construction of optimistic fair exchange with strong resolution-ambiguity. The new protocol is setup-free, stand-alone and multi-user secure without random oracles.  ...  It is known that optimistic fair exchange can be constructed (in a generic way) using "two signatures" construction [11], verifiably encrypted signature [2, 3, 8, 9, 15, 20, 18] , the sequential two-party  ...  They defined the security notions of verifiably committed signature in the multi-user setting and proposed a concrete construction of multi-user secure stand-alone and setup-free verifiably committed signature  ... 
doi:10.1007/978-3-642-13013-7_8 fatcat:rcvt3xpe5zgmhghb6h4qfne7bq

NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES

DAMIEN VERGNAUD
2009 International Journal of Foundations of Computer Science  
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003.  ...  This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures.  ...  Acknowledgements It is a pleasure to acknowledge Fabien Laguillaumie and Benoît Libert for their great comments and simplifying suggestions on a preliminary version of this paper.  ... 
doi:10.1142/s0129054109006474 fatcat:kakkuk6wa5ddhi2rjugkreejzm

New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures [article]

Damien Vergnaud
2008 arXiv   pre-print
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003.  ...  This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures.  ...  Acknowledgements It is a pleasure to acknowledge Fabien Laguillaumie and Benoît Libert for their great comments and simplifying suggestions on a preliminary version of this paper.  ... 
arXiv:0802.1076v1 fatcat:lkkn3sbblvhlhckrjvf4dswchy

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting [chapter]

Liqun Chen, Alberto N. Escalante B., Hans Löhr, Mark Manulis, Ahmad-Reza Sadeghi
2007 Lecture Notes in Computer Science  
The complexity of the proposed scheme is linear in k for the generation of multi-coupons and constant for each redeemed single coupon.  ...  Both schemes still lack some features required by many applications in practice, and also stronger forms of unsplittability are desirable.  ...  than [11] , and stronger security requirements.  ... 
doi:10.1007/978-3-540-77366-5_4 fatcat:4ue5ztcjzrcknk37zr7ecc7cbm

New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures [chapter]

Damien Vergnaud
2006 Lecture Notes in Computer Science  
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003.  ...  This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures.  ...  Acknowledgements It is a pleasure to acknowledge Fabien Laguillaumie and Benoît Libert for their great comments and simplifying suggestions on a preliminary version of this paper.  ... 
doi:10.1007/11787006_6 fatcat:ierwoldzobbzremm75amwqzp7e

On the Joint Security of Signature and Encryption Schemes under Randomness Reuse: Efficiency and Security Amplification [chapter]

Afonso Arriaga, Manuel Barbosa, Pooya Farshim
2012 Lecture Notes in Computer Science  
We introduce stronger notions of security for encryption and signatures, where challenge messages can depend in a restricted way on the random coins used in encryption, and show that two variants of the  ...  We extend the work of Bellare, Boldyreva and Staddon on the systematic analysis of randomness reuse to construct multi-recipient encryption schemes to the case where randomness is reused across different  ...  The authors would like to thank Nigel Smart and the anonymous ACNS'12 reviewers for helping to improve the quality of the paper.  ... 
doi:10.1007/978-3-642-31284-7_13 fatcat:6w5ppsu2rrhrlakjrpv3m33tiq

Optimistic Fair Exchange with Strong Resolution-Ambiguity

Xinyi Huang, Yi Mu, Willy Susilo, Wei Wu, Yang Xiang
2011 IEEE Journal on Selected Areas in Communications  
Our result not only simplifies the security analysis of OFE protocols in the multiuser setting but also provides a new approach for the design of multi-user secure OFE protocols.  ...  We prove that in the certified-key model, an OFE protocol is secure in the multi-user setting if it is secure in the single-user setting and has the property of strong resolution-ambiguity.  ...  They defined the security notions of verifiably committed signature in the multi-user setting and proposed a concrete construction of multi-user secure standalone and setup-free verifiably committed signature  ... 
doi:10.1109/jsac.2011.110814 fatcat:eye4nbgbgrggjgpacvwhdjhgrm
« Previous Showing results 1 — 15 out of 13,673 results