A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Anonymous Signatures Revisited
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
We revisit the notion of the anonymous signature, first formalized by Yang, Wong, Deng and Wang [12], and then further developed by Fischlin [6] and Zhang and Imai [13] . ...
We present a new formalism of anonymous signature, where instead of the message, a part of the signature is withheld to maintain anonymity. ...
Also, a reviewer suggested possibility of commitmentbased generic construction of anonymous signatures. ...
doi:10.1007/978-3-642-04642-1_13
fatcat:6bab63dcqffshbqfbmmseyzawi
Anonymity from Public Key Encryption to Undeniable Signatures
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this context, we revisit a well known undeniable signature scheme, whose security remained an open problem for over than a decade, and prove that it is not anonymous. ...
Next, we constructively use anonymous encryption together with secure digital signature schemes to build anonymous convertible undeniable signatures. ...
Besides, since the notion of anonymity is formalized for encryption schemes, it would be good to see whether one could constructively use anonymous encryption to build anonymous undeniable signatures using ...
doi:10.1007/978-3-642-02384-2_14
fatcat:tw52l37cpvb4ji4roq554k6tcq
Anonymous Authentication from Public-Key Encryption Revisited
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
do not suffer from linear complexity such as ring signatures. ...
However, there are quite different constructions like ring [5] and group signatures [1] to solve this task. ...
do not suffer from linear complexity such as ring signatures. ...
doi:10.1007/978-3-642-24712-5_26
fatcat:7dtfvx6hpvbatbzkbpwpend66m
Controllable Ring Signatures and Its Application to E-Prosecution
2013
Journal of Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
And this proof is non-transferable. (2) Linkable signature: the real signer can generate an anonymous signature such that every one can verify whether both this anonymous signature and the ring signature ...
This paper introduces a new concept called controllable ring signature which is ring signature with additional properties as follow. (1) Anonymous identification: by an anonymous identification protocol ...
We would like to express our gratitude thanks to the anonymous referees of WISA 2006 for their invaluable suggestions to improve this paper. ...
doi:10.4304/jcp.8.4.833-841
fatcat:5xka2snexndlliujr3ntkhvwzq
Relations among Privacy Notions for Signcryption and Key Invisible "Sign-then-Encrypt"
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper revisits the relationship amongst privacy notions for signcryption. We prove that key invisibility implies ciphertext anonymity without any additional restrictions. ...
Signcryption simultaneously offers authentication through unforgeability and confidentiality through indistinguishability against chosen ciphertext attacks by combining the functionality of digital signatures ...
Sign-then-Encrypt Generic Construction In this section, we revisit the generic construction of signcryption schemes based on the sign-then-encrypt method [1, 2] . ...
doi:10.1007/978-3-642-39059-3_13
fatcat:2aobk6yqnjgkxoistefulrs3bi
Short Linkable Ring Signatures Revisited
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Ring signature is a group-oriented signature in which the signer can spontaneously form a group and generate a signature such that the verifier is convinced the signature was generated by one member of ...
Linkable ring signature is a variant such that two signatures can be linked if and only if they were signed by the same person. Recently, the first short linkable ring signature has been proposed. ...
Anonymity in ring signatures means 1-out-of-n signer verifiability, which enables the signer to keep anonymous in these "rings" of diversion signers. ...
doi:10.1007/11774716_9
fatcat:ziglodnwz5cc7gxbajkxfnbptm
Democratic group signatures with threshold traceability
2009
Journal of Shanghai Jiaotong University (Science)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Recently, democratic group signatures(DGSs) particularly catch our attention due to their great flexibilities, i.e., no group manager, anonymity, and individual traceability. ...
In this paper, we formally describe the definition of DGS, revisit its security notions by strengthening the requirement for the property of traceability, and present a concrete DGS construction with ( ...
We revisit the requirement of individual traceability described in [19] by presenting the term threshold traceability. We express (t, n) threshold traceability for DGSs as the following. ...
doi:10.1007/s12204-009-0098-z
fatcat:jqlxs7szj5bqfh2sjdy6fonk6y
DAA-Related APIs in TPM 2.0 Revisited
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In TPM2.0, a single signature primitive is proposed to support various signature schemes including Direct Anonymous Attestation (DAA), U-Prove and Schnorr signature. ...
Then we propose new APIs which not only remove the Static Diffie-Hellman oracle but also support the forward anonymity, thus significantly improve the security of DAA and the other signature schemes supported ...
While DAA signatures can be totally anonymous, a pseudonymous DAA signature can be linked to another signature by using a specific basename. ...
doi:10.1007/978-3-319-08593-7_1
fatcat:6umuzygfsffi3bfdzfjowvd3sa
Hybrid Trapdoor Commitments and Their Applications
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
"Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on Fac-
toring"
(with R.Gennaro)
Theoretical Computer Science Vol. 370, pages 186-200, 2007.
5. ...
"Searchable Encryption Revisited: Consistency Conditions, Relation to Anonymous
IBE, and Extensions"
(with M.Abdalla, M.Bellare, E.Kiltz, T.Kohno, T.Lange, J.Malone-Lee,
G.Neven, P.Paillier and H.Shi ...
doi:10.1007/11523468_25
fatcat:dkf42t7e6zcizpqaxiuafqpswu
Building Secure and Anonymous Communication Channel: Formal Model and its Prototype Implementation
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
To cope with this issue, we propose a protocol that uses identity-based encryption for packet encryption without sacrificing anonymity, and group signature for anonymous user authentication. ...
Cryptographic tools enable anonymous user authentication while anonymous communication protocols hide users' IP addresses from service providers. ...
Finally, we revisit non-frameability. Non-frameability guarantees that no adversary A can produce a valid group signature whose open result is an honest (i.e., uncorrupted by A) user (say U ). ...
arXiv:1403.7014v3
fatcat:clceb7i2dnc5hf3setjxwkjlbe
Page 451 of Genetics Vol. 178, Issue 1
[page]
2008
Genetics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
LANGLEY, 1989 The “hitch- hiking effect” revisited. Genetics 123: 887-899.
Kim, Y., and R. NIELSEN, 2004 Linkage disequilibrium as a signature of selective sweeps. Genetics 167: 1513-1524. ...
An Accurate Model for
We thank an anonymous referee for bringing two references (INNAN and Kim 2004; Kim and NIeELsen 2004) to our attention. B.M. acknowledges support from Vetenskapsradet. ...
Revisiting Optimistic Fair Exchange Based on Ring Signatures
2014
IEEE Transactions on Information Forensics and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
They showed that an efficient optimistic fair exchange scheme secure in this sense can be constructed generically from a conventional digital signature and a two-party ring signature. ...
They showed that an efficient optimistic fair exchange scheme secure in this sense can be constructed generically from a conventional digital signature and a two-party ring signature. ...
Next, we revisit Huang et al.' ...
doi:10.1109/tifs.2014.2354986
fatcat:blas76uwb5hs3ar5kzlmdwz3hi
Page 751 of The Historical Journal Vol. 48, Issue 3
[page]
2005
The Historical Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The vigorous protests against the proposed measure (including a petition of 1,737 signatures and virulent anonymous letters to the sous-préfet) were to no effect.“® As the Millau inspecteur primaire put ...
THE ‘MILCH-COW STATE’ REVISITED 751 paralyser les attaques de milliers de prédicateurs des deux sexes, et il est a craindre que les
populations, fanatisées de longue date, ne deviennent décidément hostiles ...
Page 280 of The Library Vol. 6, Issue 3
[page]
2005
The Library
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Chere now follow attributions of authorship for 374 anonymous, pseudo nymous, or signed items appearing in the AJR, 1807-21 (vols 26-61). ...
Since many ‘signed’ articles bear signatures that are partial at best, I have made every effort to provide the fullest possible renderings of authors’
names, together with birth and death dates and professions ...
Secure and Anonymous Communication Technique: Formal Model and Its Prototype Implementation
2016
IEEE Transactions on Emerging Topics in Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To cope with this issue, we propose a secure and anonymous communication protocol by employing identity-based encryption for encrypting packets without sacrificing anonymity, and group signature for anonymous ...
However, secure and anonymous communication protocol that requires both anonymity and end-to-end encryption cannot be realized through a simple combination of current anonymous communication protocols ...
An open-free group signature GS is said to have unforgeability if Adv un GS,A (λ) := Pr[A wins] is negligible in λ. Finally, we revisit non-frameability. ...
doi:10.1109/tetc.2015.2400131
fatcat:6ij3ckwrgbcmnduowswhp52ije
« Previous
Showing results 1 — 15 out of 16,187 results