17 Hits in 4.4 sec

Provably Secure Untraceable Electronic Cash against Insider Attacks

2007 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
oracle model. key words: blind multisignature, electronic cash, provable security, random oracle model, insider attacks  ...  Firstly we discussed the security model of e-cash schemes based on the blind multisignature scheme against a (restricted) attack model and proposed a concrete scheme proven to be secure in the model [1  ...  Our Contribution We introduced the formal security model of the untraceable e-cash schemes with the blind multisignature scheme and proposed a provably secure scheme whose size of e-cash is independent  ... 
doi:10.1093/ietfec/e90-a.5.980 fatcat:yqlv7nqqorghndruj7net3j6yq

An E-Cash Scheme Based on Proxy Blind Signature from Bilinear Pairings

Zuowen Tan
2010 Journal of Computers  
In this paper, a proxy blind signature scheme based on bilinear pairing is proposed.  ...  In order to make all levels of banks issue electronic coin, the proxy blind signature scheme is applied to construct an electronic cash system.  ...  This work was supported in part by a grant from the National Natural Science Foundation of China (10961013) and The Opening Fund (09A003) of Key Lab of Network Security and Cryptology, School of Mathematics  ... 
doi:10.4304/jcp.5.11.1638-1645 fatcat:4sjd6lpxbfgojgal6bbskhwdza

Security Analysis of Offline E-cash Systems with Malicious Insider

Takashi Nishide, Shingo Miyazaki, Kouichi Sakurai
2012 Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications  
In this paper, we reconsider the security of offline anonymous electronic cash systems including more recent systems based on the classification of Miyazaki and Sakurai and investigate the possible effective  ...  When we build electronic cash systems, the main focus of the design is usually on preventing customers' malicious actions.  ...  Hanatani et al. use a blind multisignature scheme based on the Abe's scheme [38] instead of a threshold signature scheme (e.g., Shoup's threshold signature [39] ).  ... 
doi:10.22667/jowua.2012.03.31.055 dblp:journals/jowua/NishideMS12 fatcat:aoe3offbtre2ngif4h3vspzyha

Recent Advances in Information Security

Fei Yu, Chin-Chen Chang, Muhammad Khurram Khan, Tianjie Cao, Mirjana Ivanovic
2014 The Scientific World Journal  
Acknowledgments In particular, we would like to acknowledge the program committee members of Sixth International Symposium on Information Processing (ISIP 2013) In closing, we would like to take this  ...  -I Fan et al. proposes a provably secure and efficient offline e-cash scheme with date attachability based on the blind signature technique, where expiration date and deposit date can be embedded in an  ...  The paper entitled "Date attachable offline electronic cash scheme" by C.  ... 
doi:10.1155/2014/562492 pmid:25610909 pmcid:PMC4293865 fatcat:ahly5jtaobd6xouphbxl4kkxna

Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin [chapter]

Steven Goldfeder, Joseph Bonneau, Rosario Gennaro, Arvind Narayanan
2017 Lecture Notes in Computer Science  
Our schemes are compatible with Bitcoin and similar blockchain-based cryptocurrencies.  ...  However, we show that naive escrow protocols introduce both privacy and security issues. We formalize the escrow problem and present a suite of schemes with improved security and privacy properties.  ...  This was either because it relied on an older form of electronic cash in which the signed statement served as a bearer token and anyone bearing it could cash in the money, or it was due to the fact that  ... 
doi:10.1007/978-3-319-70972-7_18 fatcat:vizfsolk35fz7mjd42cicgmrka

Two Improved Partially Blind Signature Schemes from Bilinear Pairings [chapter]

Sherman S. M. Chow, Lucas C. K. Hui, S. M. Yiu, K. P. Chow
2005 Lecture Notes in Computer Science  
In this paper, we propose a threshold partially blind signature scheme from bilinear pairings and an ID-based partially blind signature scheme, which are provably secure in the random oracle model.  ...  To the best of authors' knowledge, we give the first discussion on these two notions.  ...  Fangguo Zhang for pointing out the mistake of the preliminary version of this paper (by showing a changing agreed information attack on the scheme) and all the anonymous reviewers for their helpful comments  ... 
doi:10.1007/11506157_27 fatcat:2f7ogolqzfdpphu2wrful6m3uq

Strongly Unforgeable and Efficient Proxy Signature Scheme with Fast Revocation Secure in the Standard Model

Liaojun Pang, Huiyang Zhao, Xia Zhou, Huixian Li
2016 International Journal of Distributed Sensor Networks  
Analyses show that the proposed scheme satisfies all of the security requirements of proxy signature and has shorter public parameters than the existing ones.  ...  Motivated by these concerns, a new proxy signature scheme with fast revocation is proposed, and it can be proved that the proposed scheme can achieve strong unforgeability in the standard model.  ...  [24] constructed the provably secure ID-based proxy signature schemes based on the lattice International Journal of Distributed Sensor Networks 3 problems, respectively and independently, but these  ... 
doi:10.1155/2016/3205206 fatcat:h22mewu45vdmlkdz7beb72qf44

Witness Hiding Proofs and Applications

Chen Lidong
1994 DAIMI Report Series  
Two election schemes are proposed and discussed. Especially the voting scheme is parallelized with electronic cash system so that some new tool can be introduced.  ...  The parallel divertibility is not only of theoretical significance but also a crucial point for the security of some applications, for example, electronic cash, digital signatures, etc.  ...  In the second election scheme, a "voting coin" is constructed to certify the voters, which is based on electronic cash.  ... 
doi:10.7146/dpb.v13i477.6950 fatcat:opvsf422kvhn3kkphqibux7o7y

Strong Federations: An Interoperable Blockchain Solution to Centralized Third-Party Risks [article]

Johnny Dilley, Andrew Poelstra, Jonathan Wilkins, Marta Piekarska, Ben Gorlick, Mark Friedenbach
2017 arXiv   pre-print
Bitcoin, the first peer-to-peer electronic cash system, opened the door to permissionless, private, and trustless transactions.  ...  In Liquid, Bitcoin's proof-ofwork is replaced with a k-of-n multisignature scheme.  ...  A federated model offers another solution, with a fixed signer set, in which the DMMS is replaced with a traditional multisignature scheme.  ... 
arXiv:1612.05491v3 fatcat:y26ruv4uxze6xkqb5kmsawy73q

SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies

Joseph Bonneau, Andrew Miller, Jeremy Clark, Arvind Narayanan, Joshua A. Kroll, Edward W. Felten
2015 2015 IEEE Symposium on Security and Privacy  
Finally we provide new insights on what we term disintermediation protocols, which absolve the need for trusted intermediaries in an interesting set of applications.  ...  ACKNOWLEDGMENTS The authors would like to thank the following colleagues for feedback on drafts of this paper: Sergio Demian Lerner  ...  Blind signatures prevent the bank from linking users to coins, providing unlinkability akin to cash. Throughout the 1990s, many variations and extensions of this scheme were proposed.  ... 
doi:10.1109/sp.2015.14 dblp:conf/sp/BonneauMCNKF15 fatcat:ziajrymw3bdd7houz56culqkoi

A Review of Blockchain in Fintech: Taxonomy, Challenges, and Future Directions

Keerthi Nelaturu, Han Du, Duc-Phong Le
2022 Cryptography  
In the blockchain technology, multisignatures can be used to increase to security of wallets.  ...  This signature scheme was implemented in BlindCoin [71] . Otherwise, multisignatures [72] can be used when a group of users commonly sign in a single document.  ... 
doi:10.3390/cryptography6020018 fatcat:qvcbrusribehtebs6r23h7rckq

Scaling Distributed Ledgers and Privacy-Preserving Applications [article]

Alberto Sonnino
2021 arXiv   pre-print
This settlement system is based on Byzantine Consistent Broadcast as its core primitive, foregoing the expenses of full atomic commit channels (consensus).  ...  Chainspace is scalable by sharding state; it is secure against subsets of nodes trying to compromise its integrity or availability properties through Byzantine Fault Tolerance (BFT).  ...  Efficient Threshold Signature, Multisignature and Blind Signature Schemes Based on the Gap-Diffie-Hellman-group Signature Scheme.  ... 
arXiv:2102.12273v1 fatcat:3twoaysg7rcj7h4yogwsyyzd34

A comprehensive survey on smart contract construction and execution: paradigms, tools, and systems [article]

Bin Hu, Zongyang Zhang, Jianwei Liu, Yizhong Liu, Jiayuan Yin, Rongxing Lu, Xiaodong Lin
2021 Patterns   accepted
Various schemes and tools have been proposed to facilitate the construction and execution of secure smart contracts.  ...  We divide the studies into three categories: (1) design paradigms that give examples and patterns on contract construction, (2) design tools that facilitate the development of secure smart contracts, and  ...  Bitcoin supports a set of scripts that enable the autoenforcement of some special financial affairs other than plain electronic cash exchange.  ... 
doi:10.1016/j.patter.2020.100179 pmid:33659907 pmcid:PMC7892363 arXiv:2008.13413v2 fatcat:2k4v2olwobe2vnajvpw5qd2p3e

Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies

Florian Tschorsch, Bjorn Scheuermann
2016 IEEE Communications Surveys and Tutorials  
The authors would like to thank Daniel Cagara for the discussions on this topic and for sharing his practical experience.  ...  Early Bitcoin studies gave a preliminary overview of the system's strengths and weaknesses [Barber et al. 2012 ] and compared them to paper and electronic cash [Drainville 2012 ].  ...  blinded outputs.  ... 
doi:10.1109/comst.2016.2535718 fatcat:xmdaafdgsvc6tam2kzmaeyorta

Online) International Journal of Network Security is published both in traditional paper form

Min-Shiang Hwang, Shu-Fen Chiou, Chia-Chun Wu, Cheng-Yi Yang, Ajith Abraham, Korea, Wael Adi, Iqbal Sheikh, Ahamed, Vijay Atluri, Mauro Barni, Andrew Blyth (+70 others)
2015 International Journal of Network Security   unpublished
In 2007, Camenisch, Neven and Shelat proposed an adap-tive oblivious transfer (OT) scheme in which a sender has n messages, of which a receiver can adaptively choose to receive k one-after-the-other.  ...  In this paper, we show that the scheme has a drawback that the sender can serve a single receiver only once. The drawback results from the deterministic encryption used.  ...  Then a provably secure and efficient scheme based on quadratic residue is proposed.  ... 
« Previous Showing results 1 — 15 out of 17 results