Search

Your search keyword '"Blind signatures"' showing total 131 results
Start Over Descriptor "Blind signatures"
131 results on '"Blind signatures"'

1. CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist.

Author

Katsumata, Shuichi, Lai, Yi-Fu, LeGrow, Jason T., and Qin, Ling

Subjects
INVERSE problems, ELLIPTIC curves, CLASS actions, SET functions, GROUP rings
Abstract

In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme. While at a high level the scheme resembles the Schnorr blind signature, our work does not directly follow from that construction, since isogenies do not offer as rich an algebraic structure. Specifically, our protocol does not fit into the linear identification protocol abstraction introduced by Hauck, Kiltz, and Loss (EUROCYRPT'19), which was used to generically construct Schnorr-like blind signatures based on modules such as classical groups and lattices. Consequently, our scheme is provably secure in the random oracle model (ROM) against poly-logarithmically-many concurrent sessions assuming the subexponential hardness of the group action inverse problem. In more detail, our blind signature exploits the quadratic twist of an elliptic curve in an essential way to endow isogenies with a strictly richer structure than abstract group actions (but still more restrictive than modules). The basic scheme has public key size 128 B and signature size 8 KB under the CSIDH-512 parameter sets—these are the smallest among all provably secure post-quantum secure blind signatures. Relying on a new ring variant of the group action inverse problem (rGAIP ), we can halve the signature size to 4 KB while increasing the public key size to 512 B. We provide preliminary cryptanalysis of rGAIP and show that for certain parameter settings, it is essentially as secure as the standard GAIP . Finally, we show a novel way to turn our blind signature into a partially blind signature, where we deviate from prior methods since they require hashing into the set of public keys while hiding the corresponding secret key—constructing such a hash function in the isogeny setting remains an open problem. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

3. A Threshold-Blind Signature Scheme and Its Application in Blockchain-Based Systems

Author

Victor Reyes-Macedo, Akinori Kawachi, Gina Gallegos-Garcia, and Moises Salinas-Rosales

Subjects
Blind signatures, blockchain, privacy, security, threshold signatures, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Abstract

In blockchain-based systems usually there are two common concerns: one of them is privacy and other is key management. Besides privacy has been widely studied, nor key management has been done so deeply, moreover, the conjunction of both neither has be addressed. In this work we present a threshold blind signature scheme designed on the modified version of the Paillier cryptosystem presented by Yi et al. Our scheme guarantees four main characteristics of interest: Independence meaning that our scheme could be applied to any blockchain-based transaction system, allowing to adapt it to different application scenarios, i.e. electronic voting or founds administration; secure key storage which improves the key management security by recovering the whole signature instead of the private key and avoiding to have one single point of failure. In addition, we also provide anonymity as one of the best-evaluated features on online transactions. Finally, we achieve independence from mixers or trusted third parties, which most of the time are used to reach anonymity with inherent risks. All of these characteristics are achieved without increase computational and communication cost in comparison with related work.

Published
2024
Full Text
View/download PDF

5. Rai-Choo! Evolving Blind Signatures to the Next Level

Author

Hanzlik, Lucjan, Loss, Julian, Wagner, Benedikt, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hazay, Carmit, editor, and Stam, Martijn, editor

Published
2023
Full Text
View/download PDF

6. Non-interactive Blind Signatures for Random Messages

Author

Hanzlik, Lucjan, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hazay, Carmit, editor, and Stam, Martijn, editor

Published
2023
Full Text
View/download PDF

7. e-Voting: I Changed My Mind, Now What?

Author

Peters, Daniel, Thiel, Florian, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, and Arai, Kohei, editor

Published
2023
Full Text
View/download PDF

8. Anonymity and everlasting privacy in electronic voting.

Author

Grontas, Panagiotis and Pagourtzis, Aris

Subjects
*ELECTRONIC voting, *PRIVACY, *ANONYMITY, *TRUST, *BALLOTS
Abstract

Everlasting privacy protects cryptographic voting systems against the weakening of intractability assumptions on which they may be based. We find that everlasting privacy can be obtained from protocols that do not require trust in the election talliers for privacy, as long as they are accompanied by anonymous casting. To this end, we define a novel model, U - BPRIV , to analyze such schemes. We draw inspiration from the de facto standard framework for ballot privacy, BPRIV. We then extend U - BPRIV to account for everlasting privacy. Our work differs from related attempts, which only consider everlasting privacy in the context of publicly available data. Our model is fine-grained, since it also considers the level of data leakage from the various components of an election system. We evaluate our definitions by applying our models to two protocols, each representing an important paradigm for building e-voting schemes. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

9. Two faces of blindness.

Author

Hoepman, Jaap-Henk

Subjects
BLINDNESS, PRIVACY, DEFINITIONS, CRYPTOGRAPHY
Abstract

Blind signatures are a decades-old privacy enhancing technology. It is not always clearly understood that blind signatures actually possess two separate properties: the intuitive understanding that the message to be signed is hidden from the signer, and the fact that the resulting signature is unlinkable (meaning that the signer cannot later tell in which session it created a particular signature). The question is: how exactly should these properties be defined, and can they be defined in a natural way such that they are mutually independent yet together imply blindness? In this paper we study this question, present formal definitions for message indistinguishability and signature unlinkability (and a few more related ones), and study their relationships. We show that these two properties are indeed mutually independent. Unfortunately their union is not equivalent to blindness in what appear to be only pathological cases. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

10. PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More

Author

Chairattana-Apirom, Rutchathon, Hanzlik, Lucjan, Loss, Julian, Lysyanskaya, Anna, Wagner, Benedikt, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Dodis, Yevgeniy, editor, and Shrimpton, Thomas, editor

Published
2022
Full Text
View/download PDF

11. A Fast and Simple Partially Oblivious PRF, with Applications

Author

Tyagi, Nirvan, Celi, Sofía, Ristenpart, Thomas, Sullivan, Nick, Tessaro, Stefano, Wood, Christopher A., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Dunkelman, Orr, editor, and Dziembowski, Stefan, editor

Published
2022
Full Text
View/download PDF

12. Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures

Author

Lyubashevsky, Vadim, Nguyen, Ngoc Khanh, Plancon, Maxime, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hanaoka, Goichiro, editor, Shikata, Junji, editor, and Watanabe, Yohei, editor

Published
2022
Full Text
View/download PDF

13. A Solidity implementation of TAVS

Author

Antonio M. Larriba and Damián López

Subjects
electronic vote, secret sharing, blind signatures, Solidity, blockchain, smart contracts, Information technology, T58.5-58.64
Abstract

We present a Solidity smart contract implementation of the TAVS e-voting protocol. The Two Authorities Electronic Voting Scheme (TAVS) is a voting scheme that achieves universal verifiability with a reduced time-complexity both for the elector and the voting system. TAVS security derives from the RSA cryptosystem it employs, and the assumption of two entities that do not share information. We present a Solidity implementation which replaces one of these entities with an immutable smart contract in Ethereum based networks. By doing so, our implementation extends the security properties of TAVS and achieves a higher degree of resilience, verifiability, and availability. We open source the code of the implementation.

Published
2023
Full Text
View/download PDF

14. BlindOR: an Efficient Lattice-Based Blind Signature Scheme from OR-Proofs

Author

Alkeilani Alkadri, Nabil, Harasser, Patrick, Janson, Christian, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Conti, Mauro, editor, Stevens, Marc, editor, and Krenn, Stephan, editor

Published
2021
Full Text
View/download PDF

15. The One-More Discrete Logarithm Assumption in the Generic Group Model

Author

Bauer, Balthazar, Fuchsbauer, Georg, Plouviez, Antoine, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Tibouchi, Mehdi, editor, and Wang, Huaxiong, editor

Published
2021
Full Text
View/download PDF

16. Lattice-Based Blind Signatures, Revisited

Author

Hauck, Eduard, Kiltz, Eike, Loss, Julian, Nguyen, Ngoc Khanh, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Micciancio, Daniele, editor, and Ristenpart, Thomas, editor

Published
2020
Full Text
View/download PDF

17. Lattice Blind Signatures with Forward Security

Author

Le, Huy Quoc, Duong, Dung Hoang, Susilo, Willy, Tran, Ha Thanh Nguyen, Trinh, Viet Cuong, Pieprzyk, Josef, Plantard, Thomas, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Liu, Joseph K., editor, and Cui, Hui, editor

Published
2020
Full Text
View/download PDF

18. BLAZE: Practical Lattice-Based Blind Signatures for Privacy-Preserving Applications

Author

Alkeilani Alkadri, Nabil, El Bansarkhani, Rachid, Buchmann, Johannes, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Bonneau, Joseph, editor, and Heninger, Nadia, editor

Published
2020
Full Text
View/download PDF

19. Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model

Author

Fuchsbauer, Georg, Plouviez, Antoine, Seurin, Yannick, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Canteaut, Anne, editor, and Ishai, Yuval, editor

Published
2020
Full Text
View/download PDF

20. A Modular Treatment of Blind Signatures from Identification Schemes

Author

Hauck, Eduard, Kiltz, Eike, Loss, Julian, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Ishai, Yuval, editor, and Rijmen, Vincent, editor

Published
2019
Full Text
View/download PDF

21. Cryptanalysis and improvement of a blind multi-document signcryption scheme.

Author

Zia Ullah Bashir, Malik and Ali, Rashid

Subjects
*ELECTRONIC voting, *ELECTRONIC records, *DIGITAL signatures, *VEHICULAR ad hoc networks, *ELECTRONIC systems, *CRYPTOGRAPHY, *ANONYMITY
Abstract

Blind signcryption is used to maintain the anonymity and privacy of the sender from other participants in an unsecured public network. It has vast applications for privacy related mechanisms such as electronic voting and electronic auction systems. Various blind signcryption schemes were introduced in the last two decades, depending upon the computational cost and the level of security. Some of these schemes were proven to be insecure and need further improvement. We analyzed a recently proposed blind signcryption scheme for multiple digital documents based on a hyperelliptic curve. Our cryptanalysis shows that the proposed blind signcryption scheme is not secure against the existing attacks. An adversary, with the knowledge of public parameters, can modify the signcrypted text of his choice. The successful cryptanalysis shows that the proposed scheme is unable to provide the security attributes of authentication and message integrity. To overcome the security flaws, we propose a modified version of this scheme. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

22. Efficient Round-Optimal Blind Signatures in the Standard Model

Author

Ghadafi, Essam, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Kiayias, Aggelos, editor

Published
2017
Full Text
View/download PDF

23. A Practical Multivariate Blind Signature Scheme

Author

Petzoldt, Albrecht, Szepieniec, Alan, Mohamed, Mohamed Saied Emam, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Kiayias, Aggelos, editor

Published
2017
Full Text
View/download PDF

24. Publicly auditable conditional blind signatures.

Author

Grontas, Panagiotis, Pagourtzis, Aris, Zacharakis, Alexandros, and Zhang, Bingsheng

Subjects
*ELECTRONIC voting
Abstract

This work formalizes Publicly Auditable Conditional Blind Signatures (PACBS), a new cryptographic primitive that allows the verifiable issuance of blind signatures, the validity of which is contingent upon a predicate and decided by a designated verifier. In particular, when a user requests the signing of a message, blinded to protect her privacy, the signer embeds data in the signature that makes it valid if and only if a condition holds. A verifier, identified by a private key, can check the signature and learn the value of the predicate. Auditability mechanisms in the form of non-interactive zero-knowledge proofs are provided, so that a cheating signer cannot issue arbitrary signatures and a cheating verifier cannot ignore the embedded condition. The security properties of this new primitive are defined using cryptographic games. A proof-of-concept construction, based on the Okamoto–Schnorr blind signatures infused with a plaintext equivalence test is presented and its security is analyzed. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

25. A New Post-Quantum Blind Signature From Lattice Assumptions

Author

Pingyuan Zhang, Han Jiang, Zhihua Zheng, Peichu Hu, and Qiuliang Xu

Subjects
Post-quantum cryptography, blind signatures, lattices, provable security, digital cash system, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Abstract

At present, several post-quantum cryptosystems have been proposed, and lattice-based cryptography is the main candidate. Especially in the direction of digital signatures, there are now many practical lattice-based signature schemes. However, there exist few lattice-based signatures with special property such as blind signature. Blind signature was introduced by Chaum for creating untraceable payment system. Then, it is widely used in e-cash and voting, especially in the revolutionary digital cash system based on blockchain. In our paper, we present a method to construct a post-quantum blind signature based on lattice assumptions, and we proved that any existential forger against the security of the resulting scheme can solve the SISq,n,m,β problem for β = Õ(dn). Our main technique is the rejection sampling theory. The expected number of times needed to output a blind signature is at most e2 under aborting, and our new scheme has much smaller signature size than those of all the previously proposed blind signature schemes over lattices.

Published
2018
Full Text
View/download PDF

26. Multi-theorem Preprocessing NIZKs from Lattices.

Author

Kim, Sam and Wu, David J.

Subjects
TRANSFER functions, QUANTUM cryptography, STANDARD language, CRYPTOGRAPHY
Abstract

Non-interactive zero-knowledge (NIZK) proofs are fundamental to modern cryptography. Numerous NIZK constructions are known in both the random oracle and the common reference string (CRS) models. In the CRS model, there exist constructions from several classes of cryptographic assumptions such as trapdoor permutations, pairings, and indistinguishability obfuscation. However, at the time of the initial publication of this work, we did not have constructions of NIZKs from standard lattice assumptions. In this work, we take an initial step toward constructing multi-theorem NIZKs for general NP languages from standard lattice assumptions by considering a relaxation to the preprocessing model and a new model we call the designated-prover model. In the preprocessing model, a setup algorithm generates secret proving and verification keys for the prover and the verifier, respectively. In the designated-prover model, the proving key is secret, but the verification key is public. In both settings, the proving key is used to construct proofs and the verification key is used to check proofs. Finally, in the multi-theorem setting, both the proving and verification keys should be reusable for an unbounded number of theorems without compromising soundness or zero-knowledge. Previous constructions of NIZKs in the preprocessing model that rely on weaker assumptions like one-way functions or oblivious transfer are only secure in a single-theorem setting. Thus, constructing multi-theorem NIZKs in these relaxed models does not seem to be inherently easier than constructing them in the CRS model. In this work, we first construct a multi-theorem preprocessing NIZK argument from context-hiding homomorphic signatures. In fact, the construction is a designated-prover NIZK. We also show that using homomorphic commitments, we can get statistically sound proofs in the preprocessing and designated-prover models. Together with lattice-based instantiations of homomorphic signatures and commitments, we obtain the first multi-theorem NIZKs in the preprocessing and designated-prover models from standard lattice assumptions. Finally, we show how to generalize our construction to obtain a universally composable NIZK (UC-NIZK) in the preprocessing model from standard lattice assumptions. Our UC-NIZK relies on a simple preprocessing protocol based on a new primitive we call blind homomorphic signatures. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

27. Blindly Signed Contracts: Anonymous On-Blockchain and Off-Blockchain Bitcoin Transactions

Author

Heilman, Ethan, Baldimtsi, Foteini, Goldberg, Sharon, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Clark, Jeremy, editor, Meiklejohn, Sarah, editor, Ryan, Peter Y.A., editor, Wallach, Dan, editor, Brenner, Michael, editor, and Rohloff, Kurt, editor

Published
2016
Full Text
View/download PDF

28. A Privacy-Friendly Method to Reward Participants of Online-Surveys

Author

Herfert, Michael, Lange, Benjamin, Selzer, Annika, Waldmann, Ulrich, Diniz Junqueira Barbosa, Simone, Series editor, Chen, Phoebe, Series editor, Du, Xiaoyong, Series editor, Filipe, Joaquim, Series editor, Kara, Orhun, Series editor, Kotenko, Igor, Series editor, Liu, Ting, Series editor, Sivalingam, Krishna M., Series editor, Washio, Takashi, Series editor, Katsikas, Sokratis K., editor, and Sideridis, Alexander B., editor

Published
2015
Full Text
View/download PDF

30. Privacy-Preserving Loyalty Programs

Author

Blanco-Justicia, Alberto, Domingo-Ferrer, Josep, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Garcia-Alfaro, Joaquin, editor, Herrera-Joancomartí, Jordi, editor, Lupu, Emil, editor, Posegga, Joachim, editor, Aldini, Alessandro, editor, Martinelli, Fabio, editor, and Suri, Neeraj, editor

Published
2015
Full Text
View/download PDF

32. Blind Signatures

Author

Carminati, Barbara, Ferrari, Elena, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor

Published
2018
Full Text
View/download PDF

33. On the Security of One-Witness Blind Signature Schemes

Author

Baldimtsi, Foteini, Lysyanskaya, Anna, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sako, Kazue, editor, and Sarkar, Palash, editor

Published
2013
Full Text
View/download PDF

34. Formalizing Group Blind Signatures and Practical Constructions without Random Oracles

Author

Ghadafi, Essam, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Boyd, Colin, editor, and Simpson, Leonie, editor

Published
2013
Full Text
View/download PDF

37. Password-Based Signatures

Author

Gjøsteen, Kristian, Thuen, Øystein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Petkova-Nikova, Svetla, editor, Pashalidis, Andreas, editor, and Pernul, Günther, editor

Published
2012
Full Text
View/download PDF

38. Commuting Signatures and Verifiable Encryption

Author

Fuchsbauer, Georg, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Paterson, Kenneth G., editor

Published
2011
Full Text
View/download PDF

41. Lattice-Based Blind Signatures

Author

Rückert, Markus, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Abe, Masayuki, editor

Published
2010
Full Text
View/download PDF

42. Fair Partially Blind Signatures

Author

Rückert, Markus, Schröder, Dominique, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bernstein, Daniel J., editor, and Lange, Tanja, editor

Published
2010
Full Text
View/download PDF

43. Fair Blind Signatures without Random Oracles

Author

Fuchsbauer, Georg, Vergnaud, Damien, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bernstein, Daniel J., editor, and Lange, Tanja, editor

Published
2010
Full Text
View/download PDF

44. SECURITY WITHOUT IDENTIFICATION: TRANSACTION SYSTEMS TO MAKE BIG BROTHER OBSOLETE.

Author

Chaum, David

Subjects
*TRANSACTION systems (Computer systems), *COMPUTER security, *TELECOMMUNICATION systems, *FORGERY, *MAILING lists (Lists of addresses), *ELECTRONIC data processing
Abstract

The article focuses on security issues related to computerized transaction systems. As more communication travels in electromagnetic and digital form, it becomes easier to learn more about individuals from their communication. Exposure of message content is one obvious danger that is already addressed by well-known cryptographic coding techniques. A more subtle and difficult problem with current communication systems, however, is the exposure of "tracing information." Individuals' addresses, which are often required by organizations and are commonly sold freely by them as mailing lists, are one kind of tracing information. The trend is towards greater use of such information. The other side of the issue is that current transaction systems provide inadequate protection against individuals who forge messages, or falsely disavow having sent or received messages. With paper communication, handwritten signatures are easily forged well enough to pass routine checking against signature samples and cannot be verified with certainty, even by expert witnesses. Also, paper receipts for delivery are too costly for most transactions, are often based only on handwritten signatures, and usually do not indicate message content.

Published
1985
Full Text
View/download PDF

45. Round-Optimal Blind Signatures from Waters Signatures

Author

Gjøsteen, Kristian, Kråkmo, Lillian, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Baek, Joonsang, editor, Bao, Feng, editor, Chen, Kefei, editor, and Lai, Xuejia, editor

Published
2008
Full Text
View/download PDF

46. A Design of Fair Blind Signatures Protocol Using PVNIOT

Author

Kim, Jeom-goo, Lee, Do-hyeon, Lee, Jeog-bae, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gervasi, Osvaldo, editor, and Gavrilova, Marina L., editor

Published
2007
Full Text
View/download PDF

47. Fair Blind Signatures Revisited

Author

Hufschmitt, Emeline, Traoré, Jacques, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Takagi, Tsuyoshi, editor, Okamoto, Tatsuaki, editor, Okamoto, Eiji, editor, and Okamoto, Takeshi, editor

Published
2007
Full Text
View/download PDF

48. Differential Properties of Elliptic Curves and Blind Signatures

Author

Brumley, Billy Bob, Nyberg, Kaisa, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Garay, Juan A., editor, Lenstra, Arjen K., editor, Mambo, Masahiro, editor, and Peralta, René, editor

Published
2007
Full Text
View/download PDF

49. On the (Im)possibility of Blind Message Authentication Codes

Author

Abdalla, Michel, Namprempre, Chanathip, Neven, Gregory, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Pointcheval, David, editor

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results