2,169 Hits in 3.5 sec

Deciding the Security of Protocols with Commuting Public Key Encryption

Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
2005 Electronical Notes in Theoretical Computer Science  
In this paper, we present an NP decision procedure for the insecurity of protocols that employ RSA encryption, which is one of the most important instances of commuting public key encryption.  ...  Many cryptographic protocols and attacks on these protocols make use of the fact that the order in which encryption is performed does not affect the result of the encryption, i.e., encryption is commutative  ...  Conclusion We have shown that the security problem for a class of protocols with commuting public key encryptions is in NP.  ... 
doi:10.1016/j.entcs.2004.05.019 fatcat:gmz7g4sxrzae3b27zqwawnvtge

A survey of algebraic properties used in cryptographic protocols

Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade
2006 Journal of Computer Security  
Moreover, the executability of some protocols relies explicitly on some algebraic properties of cryptographic primitives such as commutative encryption.  ...  However, formal approaches usually consider the encryption schemes as black boxes and assume that an adversary cannot learn anything from an encrypted message except if he has the key.  ...  Acknowledgments The authors would like to thank anonymous referees for their very helpful comments and Ralf Treinen to have read a preliminary version of this survey.  ... 
doi:10.3233/jcs-2006-14101 fatcat:offe7jsai5e5rl7jswiccgsyiq

Deniable encryption protocols based on probabilistic public-key encryption

Nikolay Moldovyan, Andrey Berezin, Anatoly Kornienko, Alexander Moldovyan
2017 2017 20th Conference of Open Innovations Association (FRUCT)  
The paper proposes a new method for designing deniable encryption protocols characterized in using RSA-like probabilistic public-key encryption algorithms.  ...  To provide bi-deniability in the case of attacks perfored by an active coercer stage of entity authentication is used in one of described protocols.  ...  The main feature of the proposed design is combining probabilist public-key encryption with the commutative encryption, the last being implemented without exchanging encryption keys (called local keys)  ... 
doi:10.23919/fruct.2017.8071324 dblp:conf/fruct/MoldovyanBKM17 fatcat:kydcj6xgrraerksys7ld57d5jy

Single-bit re-encryption with applications to distributed proof systems

Nikita Borisov, Kazuhiro Minami
2007 Proceedings of the 2007 ACM workshop on Privacy in electronic society - WPES '07  
Moreover, this channel is present with any traditional choice of public key encryption functions.  ...  We then extend the primitive to support commutative encryption as well.  ...  with the final version of the paper.  ... 
doi:10.1145/1314333.1314341 dblp:conf/wpes/BorisovM07 fatcat:mtujpttyuneyljmiq63od3ikwy

Secure Multi Party Computation Technique for Classification Rule Sharing

Murugeshwari B, Jayakumar C, Sarukesi K
2012 International Journal of Computer Applications  
Privacy of the data transacted or secure multiparty computation is achieved by using the commutative RSA cryptography scheme.  ...  The proposed model is compared with the existing secure group communication techniques like Secure Lock and Asynchronous Control Polynomial in terms of computational efficiency.  ...  In order to address this concern the approach proposed in this paper does not consider distribution of any keys rather considers some pre decided prime integers required for key generation in commutative  ... 
doi:10.5120/8764-2683 fatcat:fozueiaks5giviwyrmsrktd7k4

An Effective Non-Commutative Encryption Approach with Optimized Genetic Algorithm for Ensuring Data Protection in Cloud Computing

S. Jerald Nirmal Kumar, S. Ravimaran, M. M. Gowthul Alam
2020 CMES - Computer Modeling in Engineering & Sciences  
Hence, to secure both data and keys ensuring secured data storage and access, our proposed work designs a Novel Quantum Key Distribution (QKD) relying upon a non-commutative encryption framework.  ...  It makes use of a Novel Quantum Key Distribution approach, which guarantees high level secured data transmission.  ...  These key exchange protocols are used to provide the private keys of remote entities to secretly encrypt their next connection through the interaction of private key algorithms.  ... 
doi:10.32604/cmes.2020.09361 fatcat:gcgdtfgbivf4dj7icc4yvvoufq

Does It Need Trusted Third Party? Design of Buyer-Seller Watermarking Protocol without Trusted Third Party [chapter]

Jae-Gwi Choi, Kouichi Sakurai, Ji-Hwan Park
2003 Lecture Notes in Computer Science  
In this paper, we show shortcomings of this protocol and suggest a buyer-seller watermarking protocol that provides security of buyers and sellers without trusted third party.  ...  Thus this scheme must assume existence of the trusted third parties for its security.  ...  Besides, [JK02] scheme also must assume honesty of the judge, because a buyer's secret key is encrypted with the judge's public key.  ... 
doi:10.1007/978-3-540-45203-4_21 fatcat:kcumykyqjrhkhguctfqpgu54pi

Cryptanalysis of Two Anonymous Buyer-Seller Watermarking Protocols and an Improvement for True Anonymity [chapter]

Bok-Min Goi, Raphael C. -W. Phan, Yanjiang Yang, Feng Bao, Robert H. Deng, M. U. Siddiqi
2004 Lecture Notes in Computer Science  
Our results suggest that the security of these protocols must assume the honesty of WCA, contrary to the designers' original claim.  ...  by the buyer; ii) for both protocols, the seller can discover the watermark chosen by the buyer if he colludes with the WCA.  ...  /D h (.) encryption/decryption algorithm of a public-key cryptosystem with homomorphic property E c (.)  ... 
doi:10.1007/978-3-540-24852-1_27 fatcat:yavxffz56vgdtjedordpro6gie

Privacy preserving distributed profile matching in mobile social network [article]

Rachid Chergui
2015 arXiv   pre-print
This is why a new encryption algorithm having an high level of security while preserving resources is proposed in this paper.  ...  of privacy in distributed profile matching.  ...  Public/Private Keys Generation with ECC In this section we show how we can generate the public and private keys for encryption, following the cryptosystem proposed by Boneh et al. [15] .  ... 
arXiv:1502.06993v1 fatcat:pbdyklxsunamrbeatzxgr6qkmq

Privacy-Preserving Content-Based Publish/Subscribe Networks [chapter]

Abdullatif Shikfa, Melek Önen, Refik Molva
2009 IFIP Advances in Information and Communication Technology  
We suggest a solution based on a commutative multiple encryption scheme in order to allow brokers to operate in-network matching and content based routing without having access to the content of the packets  ...  This problem raises a challenging requirement for handling encrypted data for the purpose of routing based on protected content and encrypted subscription information.  ...  Acknowledgments The authors would like to thank Erik-Oliver Blaß for fruitfull discussions and comments.  ... 
doi:10.1007/978-3-642-01244-0_24 fatcat:qc67syfogneati2czuav75mt3a

A commutative encrypted protocol for the privacy protection of watermarks in digital contents

Shing-chi Cheung, Ho-fung Leung, Changjie Wang
2004 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the  
Our protocol employs a commutative encryption algorithm to protect the privacy of watermarks. Information is doubly locked by two encryption keys kept separately by a customer and a content provider.  ...  In the protocol, a customer only gets a piece of watermarked multimedia contents in a transaction and the content provider has no idea how the watermark is formed.  ...  Such solution will improve the efficiency of our protocol. We are developing a symmetric key encryption algorithm with commutative property.  ... 
doi:10.1109/hicss.2004.1265256 dblp:conf/hicss/CheungLW04 fatcat:x7opqmqy4jbaljmkgwo2sh66t4

Efficient private multi-party computations of trust in the presence of curious and malicious users

Shlomi Dolev, Niv Gilboa, Marina Kopeetsky
2014 Journal of Trust Management  
The Public Key Encryption Protocol PKEP outputs a set of the exact trust values given by the users without linking the user that contributed a specific trust value to the trust this user contributed.  ...  Moreover, the Commutative Encryption Based Protocol (CEBP) extends the PKEBP in this case. The computation of all our algorithms requires the transmission of O(n) (possibly large) messages.  ...  The paper is a full version of two extended abstracts each describing a different part of the results [8, 9] .  ... 
doi:10.1186/2196-064x-1-8 fatcat:7be33aw77ndobo5mpcpcmq4wyi

Analysis on Secure Key Agreement Protocol Using Trusted Third Party Information Sensitivity Systems

Gnanasekaran P, Umadevi V
2019 International Journal of Engineering and Applied Sciences (IJEAS)  
The planned protocol relies on Diffie-Hellman key exchange protocol.  ...  Within the past, many key agreement protocols square measure planned on watchword based mostly mechanism. These protocols square measure prone to wordbook attacks.  ...  The projected protocol is secure against wordbook attacks as we have a tendency to use only once keys with server.  ... 
doi:10.31873/ijeas.6.12.01 fatcat:ghvfvtorxjedxh6cym2tqm7qte

Publicly Verifiable M + 1st-Price Auction Fit for IoT with Minimum Storage

Po-Chu Hsu, Atsuko Miyaji, David Megias
2021 Security and Communication Networks  
In this paper, we formalize a notion of commutative bi-homomorphic multiparty encryption and achieve no-TTP M + 1 -st auction based on blockchain with public verifiability.  ...  All of the previous auctions are not fit for edge-assisted IoT since they need TTP.  ...  Acknowledgments is study was partially supported by enPiT (Education Network for Practical Information Technologies) of MEXT and Innovation Platform for Society 5.0 of MEXT.  ... 
doi:10.1155/2021/1615117 fatcat:f3pwl32w4nbpdpwqcdafaicmdm

Anonymizing and Confidential Databases for Privacy Protection Using Suppression and Generalization Based Protocols

K. Sathyamoorthy, Tina Belinda Miranda, S.Venkata Lakshmi
2015 International Journal of Computer Applications Technology and Research  
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data confidentiality.  ...  Then, X encrypts c(∂i)with his private key and sends EA(c(∂i))to Y.2.  ...  Given a finite set K of keys and a finite domain D, a commutative, product homomorphic encryption scheme E is a polynomial time computable function E : K X D→D satisfying the following properties: 1.Commutativity  ... 
doi:10.7753/ijcatr0404.1011 fatcat:q6jth33fm5bi3ha6ohoodfgihi
« Previous Showing results 1 — 15 out of 2,169 results