Filters








2,503 Hits in 4.0 sec

Fully Anonymous Group Signatures Without Random Oracles [chapter]

Jens Groth
Advances in Cryptology – ASIACRYPT 2007  
The scheme satisfies strong security requirements, in particular providing protection against key exposures and not relying on random oracles in the security proof.  ...  We construct a new group signature scheme using bilinear groups.  ...  Acknowledgment We thank Essam Ghadafi for pointing out the need for a strong one-time signature scheme with security against an adaptive chosen message attack instead of the security against a weak chosen  ... 
doi:10.1007/978-3-540-76900-2_10 dblp:conf/asiacrypt/Groth07 fatcat:n2lrkw54qrhzzjtkitp5ett2ka

Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings [chapter]

Lan Nguyen, Rei Safavi-Naini
2004 Lecture Notes in Computer Science  
Weak Anonymity = Anonymity -Open oracleGroup Signatures vs.  ...  DL, in the random oracle model. • GS1 provides Anonymity, GS2 provides Weak Anonymity, assuming DBDH, in the random oracle model. • Open Problem: Does GS2 provide Anonymity?  ... 
doi:10.1007/978-3-540-30539-2_26 fatcat:y7pr66zfuvhfzfqdiv4sgokira

On Anonymity of Group Signatures [chapter]

Sujing Zhou, Dongdai Lin
2005 Lecture Notes in Computer Science  
A secure group signature is required to be anonymous, that is, given two group signatures generated by two different members on the same message or two group signatures generated by the same member on  ...  In this paper we prove the equivalence of a group signature's anonymity and its indistinguishability against chosen ciphertext attacks if we view a group signature as an encryption of member identity.  ...  ACJT's group signature is anonymous under DDH assumption in random oracle model. A Proof of Anonymity Theorem 5.  ... 
doi:10.1007/11596981_19 fatcat:embxnmoy3zbltmnrqbltx7ozje

On Randomness Exposure Resilience of Group Signatures

Tomoyoshi ONO, Kazuki YONEYAMA
2017 IEICE transactions on information and systems  
Group signature (GS) schemes guarantee anonymity of the actual signer among group members. Previous GS schemes assume that randomness in signing is never exposed.  ...  Next, we clarify that it is impossible to achieve full-anonymity against full randomness exposure without any secure component (e.g., a tamper-proof module or a trusted outside storage).  ...  Group signature (GS) [1] is a special kind of digital signatures to provide both authenticity and anonymity.  ... 
doi:10.1587/transinf.2016inp0015 fatcat:s5wbj54nzrc6jhp3narxndvozm

Dynamic Fully Anonymous Short Group Signatures [chapter]

Cécile Delerablée, David Pointcheval
2006 Lecture Notes in Computer Science  
It achieves stronger security notions than BBS, and namely the full anonymity, while still shorter. The proofs hold under the q-SDH and the XDH assumptions, in the random oracle model.  ...  Group signatures allow members to sign on behalf of a group. Recently, several schemes have been proposed, in order to provide more efficient and shorter group signatures.  ...  Acknowledgements The authors would like to thank the anonymous referees for their helpful comments. References  ... 
doi:10.1007/11958239_13 fatcat:igrhojlz75fdvfuyacjvi7ynmq

Foundations of Fully Dynamic Group Signatures [chapter]

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth
2016 Lecture Notes in Computer Science  
In this work we take a close look at existing security definitions for fully dynamic group signatures.  ...  They allow members of a group to anonymously sign on behalf of the group. Membership is overseen by a designated group manager.  ...  gave a number of efficient constructions of group signatures supporting revocation without requiring random oracles by utilizing the subset cover framework [?]  ... 
doi:10.1007/978-3-319-39555-5_7 fatcat:ksooufnb3vesnhhj4xyh6lchuu

Certificateless Remote Anonymous Authentication Schemes for WirelessBody Area Networks

Jingwei Liu, Zonghua Zhang, Xiaofeng Chen, Kyung Sup Kwak
2014 IEEE Transactions on Parallel and Distributed Systems  
chosen message attack in the random oracle model.  ...  In this paper, we present a pair of efficient and light-weight authentication protocols to enable remote WBAN users to anonymously enjoy healthcare service.  ...  The authors would like to thank the anonymous referees and the associate editor for their constructive comments and suggestions that helped to improve the manuscript.  ... 
doi:10.1109/tpds.2013.145 fatcat:nhvwhewh6na5hhjy7n3lcxy7sq

Real Hidden Identity-Based Signatures [chapter]

Sherman S. M. Chow, Haibin Zhang, Tao Zhang
2017 Lecture Notes in Computer Science  
Group signature allows members to issue signatures on behalf of the group anonymously in normal circumstances.  ...  We believe our work will improve the usability of group signature and its variant.  ...  random oracles.  ... 
doi:10.1007/978-3-319-70972-7_2 fatcat:min3w37fv5hidax4ikzsmaftiq

Formalizing Group Blind Signatures and Practical Constructions without Random Oracles [chapter]

Essam Ghadafi
2013 Lecture Notes in Computer Science  
does not rely on random oracles.  ...  The schemes presented in [34] were based on different variants of the Camenisch-Stadler group signature [14] and their security required the use of random oracles.  ...  The re-randomization is done without knowledge of neither the witness concealed in the commitments or the associated randomness.  ... 
doi:10.1007/978-3-642-39059-3_23 fatcat:r6tiqxouxngival265ohibgdta

Foundations of Fully Dynamic Group Signatures

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth
2020 Journal of Cryptology  
Group signatures allow members of a group to anonymously sign on behalf of the group. Membership is administered by a designated group manager.  ...  We fill the gap by providing a formal rigorous security model for fully dynamic group signatures.  ...  In this work, we address the fundamental question of defining security for fully dynamic group signatures. Background and Related Work Group Signatures Without Revocation.  ... 
doi:10.1007/s00145-020-09357-w fatcat:cbboijkhafbifhlsbks2lkf4qu

Achieving Strong Security and Member Registration for Lattice-based Group Signature Scheme with Verifier-local Revocation

Maharage Nisansala Sevwandi Perera, Takeshi Koshiba
2018 Journal of Internet Services and Information Security  
A fully dynamic group signature scheme with member registration and member revocation with strong security is desirable when using group signatures in real life.  ...  In this paper, we obtain a fully dynamic group signature scheme by proposing a group joining protocol to their scheme.  ...  Definition 4 . 4 Let A be an adversary against the anonymity of a fully dynamic group signature scheme FDGS.  ... 
doi:10.22667/jisis.2018.11.30.001 dblp:journals/jisis/PereraK18 fatcat:lg264b5ux5hrpevfcvzgkvwt2q

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions [chapter]

Mihir Bellare, Daniele Micciancio, Bogdan Warinschi
2003 Lecture Notes in Computer Science  
This paper provides theoretical foundations for the group signature primitive. We introduce strong, formal definitions for the core requirements of anonymity and traceability.  ...  Finally we prove the existence of a construct meeting our definitions based only on the sole assumption that trapdoor permutations exist. 2 Definitions of the security of group signature schemes Notation  ...  signature scheme that is fully-anonymous and fully-traceable.  ... 
doi:10.1007/3-540-39200-9_38 fatcat:7gpvjwoonfgolomifd55eja6qi

Linkable Democratic Group Signatures [chapter]

Mark Manulis, Ahmad-Reza Sadeghi, Jörg Schwenk
2006 Lecture Notes in Computer Science  
We propose a concrete linkable democratic group signature scheme for two-parties, prove its security in the random oracle model, and describe how to modularly extend it to the multi-party case. authority  ...  link the signatures issued by the same signer without tracing.  ...  is fully random.  ... 
doi:10.1007/11689522_18 fatcat:63r2lnfu5rfktaptyyhdiyxrk4

Group Message Authentication [chapter]

Bartosz Przydatek, Douglas Wikström
2010 Lecture Notes in Computer Science  
Group signatures is a powerful primitive with many practical applications, allowing a group of parties to share a signature functionality, while protecting the anonymity of the signer.  ...  However, despite intensive research in the past years, there is still no fully satisfactory implementation of group signatures in the plain model.  ...  The standard group signature schemes, analyzed in the random oracle model, clearly out-perform our scheme, but the random oracle model is not sound [7] .  ... 
doi:10.1007/978-3-642-15317-4_25 fatcat:6zs3gggu6fbktjgu5vepzdwnua

Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors [chapter]

Marc Fischlin
2005 Lecture Notes in Computer Science  
We show how to turn three-move proofs of knowledge into non-interactive ones in the random oracle model.  ...  signature scheme suggested recently by Boneh, Boyen and Shacham with our construction.  ...  Acknowledgments We thank the anonymous reviewers of Crypto 2005 for very comprehensive comments and suggestions.  ... 
doi:10.1007/11535218_10 fatcat:23fbgdy7crcurch2ecqyd3kbqe
« Previous Showing results 1 — 15 out of 2,503 results