Nothing Special   »   [go: up one dir, main page]

Liu et al., 2016 - Google Patents

Secure three-party computational protocols for triangle area

Liu et al., 2016

View PDF
Document ID
7793677626577044987
Author
Liu L
Chen X
Lou W
Publication year
Publication venue
International Journal of Information Security

External Links

Snippet

In this work, we have put forth two different protocols to address a concrete secure multi- party computational (MPC) problem related to a triangle, of which the coordinates of the three vertices are confidentially kept by the three participants, respectively. The three parties …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0838—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
    • H04L9/0841—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these involving Diffie-Hellman or related key agreement protocols
    • H04L9/0844—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these involving Diffie-Hellman or related key agreement protocols with user authentication or key authentication, e.g. ElGamal, MTI, MQV-Menezes-Qu-Vanstone protocol or Diffie-Hellman protocols using implicitly-certified keys
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
    • H04L9/3073—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing

Similar Documents

Publication Publication Date Title
Han et al. Improving privacy and security in decentralized ciphertext-policy attribute-based encryption
Groth et al. Cryptography in the multi-string model
Wang et al. Traceable ciphertext-policy attribute-based encryption scheme with attribute level user revocation for cloud storage
Shi et al. An efficient quantum scheme for private set intersection
Kolesnikov et al. A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design
Bartusek et al. Cryptography with certified deletion
Zhao et al. Can you find the one for me?
Lyu et al. Towards fair and decentralized privacy-preserving deep learning with blockchain
Zhao et al. Are you the one to share? Secret transfer with access structure
Zhou et al. Privacy‐Preserving Federated Learning Framework with General Aggregation and Multiparty Entity Matching
Liu et al. Secure three-party computational protocols for triangle area
Wang et al. PeGraph: A system for privacy-preserving and efficient search over encrypted social graphs
Barkataki et al. On achieving secure collaboration in supply chains
Mashhadi et al. Provably secure verifiable multi‐stage secret sharing scheme based on monotone span program
Debnath et al. Efficient private set intersection cardinality in the presence of malicious adversaries
Choudhury et al. Secure Multi-Party Computation Against Passive Adversaries
Wang et al. Anonymous blockchain-based system for consortium
Alamer A privacy-preserving federated learning with a secure collaborative for malware detection models using Internet of Things resources
Yadav et al. Private computation of the Schulze voting method over the cloud
Keshavarzkalhori et al. Federify: a verifiable federated learning scheme based on zksnarks and blockchain
Wei et al. Efficient multi-party private set intersection protocols for large participants and small sets
Damgård et al. Commodity-based 2PC for arithmetic circuits
Mihailescu et al. Software engineering and applied cryptography in cloud computing and big data
Rehman et al. Securing cloud storage by remote data integrity check with secured key generation
Suegami Smart contracts obfuscation from blockchain-based one-time program