CN107342900A - A kind of allocation of computer device of signal communication bag - Google Patents

A kind of allocation of computer device of signal communication bag Download PDF

Info

Publication number
CN107342900A
CN107342900A CN201710562999.2A CN201710562999A CN107342900A CN 107342900 A CN107342900 A CN 107342900A CN 201710562999 A CN201710562999 A CN 201710562999A CN 107342900 A CN107342900 A CN 107342900A
Authority
CN
China
Prior art keywords
mrow
msubsup
msub
mtd
attribute
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710562999.2A
Other languages
Chinese (zh)
Inventor
陈焕英
王宛平
崔冬
孙沛硕
王红雷
王京
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xue Geli
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201710562999.2A priority Critical patent/CN107342900A/en
Publication of CN107342900A publication Critical patent/CN107342900A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • 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 communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • 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 communications; Network security protocols
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
    • H04L9/302—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
    • 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 communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention belongs to computer realm, disclose a kind of allocation of computer device of signal communication bag, including transmitting terminal, computer, communication domain path control deivce, encryption chip, router, receiving terminal, wireless receiving module, deciphering chip, processing module, wireless sending module.It is connected to by computer between source terminal and purpose terminal, computer leads the mapping value into packet with communication port by the communication domain path control deivce inside manipulating, when communication domain route executor relies on packet to carry out configuration network node, data transfer is controlled in diversification；It can also implement to encrypt, ensure the security of data.

Description

A kind of allocation of computer device of signal communication bag
Technical field
The invention belongs to computer realm, more particularly to a kind of allocation of computer device of signal communication bag.
Background technology
The transmission of signal communication bag often simply by source terminal and purpose terminal, at most comes plus router or interchanger Carry out, such transmission is single in allotment and the unusual mechanization of scheduling aspect, the function of transmission.
In summary, the problem of prior art is present be：Transmit in allotment and the unusual mechanization of scheduling aspect, transmission Function is single.
The content of the invention
The problem of existing for prior art, the invention provides a kind of allocation of computer device of signal communication bag,
The present invention is achieved in that a kind of allocation of computer device of signal communication bag, the calculating of the signal communication bag Machine configurator includes：Transmitting terminal, computer, router, receiving terminal；
Transmitting terminal is connected by wireless network with computer, and computer is connected by netting twine with router, and router passes through Wireless network and the connection received；
The wireless network user attribute private key generation：
Attribute authority (aa) mechanism unit using system public key PK and main private key MK as input, the user terminal decrypted as needed Attribute list L=(L1, L2..., Ln), wherein, n is the number of attribute in system, generates attribute private key SKLAnd it is sent to user Terminal；Specifically include：
The first step, attribute authority (aa) mechanism unit is in ZpIn randomly select r, r '1, r '2..., r 'nWith r "1, r "2..., r "n, Calculate
Second step, ifAttribute authority (aa) mechanism unit calculatesOtherwise Attribute authority (aa) mechanism unit calculatesWhereinIth attribute w in expression systemiNiIn individual value kiIndividual value,Represent attribute wiNegative value；
3rd step, attribute authority (aa) mechanism unit calculateMake Di=(DI, 1, DI, 2）；
4th step, attribute authority (aa) mechanism unit calculateMake Fi=(FI, 1, FI, 2)；
5th step, attribute authority (aa) mechanism unit make SKL=(L, D0, { Di, Fi}1≤i≤n)；
The computer includes communication domain path control deivce, encryption chip；
The router includes：Wireless sending module；Specific side of the router for the verification operation of encryption data Method is：
Step 1: the existence of search key：When data user only receives the A of Cloud Server return, use first The public key of data owner is verified to A；IfThen pass through checking；Operation is decrypted to C to obtain Take symmetric key sk1, decryption A obtains Bloom filter BF, if BFverify (w)=0, it is meant that is not present and uses on Cloud Server The keyword that family is searched for, conversely, rejecting returning result；
Step 2: the correctness of search key：When data user receives { W, F, A, B, C }, W/f is calculated1WithSuch as FruitIllustrate correctly, conversely, explanation is error result；
Step 3: the integrality of the data file address comprising keyword w：When data user demonstrates the correct of keyword After property, then B is verified, ifThen sk is obtained by decrypting C1, and then obtain number of targets According to file；
The encryption method of the router includes：
Trusted authority center operation RSA Algorithm is that Cloud Server and data owner generate public private key pair：{(n1,e1),d1} { (n2,e2),d2}；Data owner ensures the integrality of data file by digital signature；With the public key pair of Cloud Server Ciphertext keyword is re-encrypted to prevent the offline guessing attack of external attacker, when data owner uses SYMEnc() encrypts Algorithm returns to the address of encryption file, is designated as ID { F to being contracted out to Cloud Server, server after data file encryptioni, so wrap The data file of the w containing keyword is represented by IDw=ID { F1}||ID{F2}…||ID{Fi}；Specifically include：
Step 1: initialization (1l)：Trusted authority center selects Bilinear map：e:G×G→GT, G and GTIt is that rank is following for p Ring group, p are the primitive element of l bit longs, select the hash function under random oracle
H1:{0,1}*→G；H2:{0,1}*→ZpIt is one-way Hash function, selects a, b, c ← Zp, g ← G,
Pm=(H1,H2,e,g,p,ga,gb,gc,G,GT),
Mk=(a, b, c)
Then k independent hash function H' are chosen1,…,H'k, for the Bloom filter BF of the construction m bits of m bits Data owner is sent to, is that data owner and Cloud Server generate public private key pair { (n1,e1),d1And { (n2,e2),d2}；
Step 2: key generation (mk, T)：Trusted authority center performs Share (T, ac) algorithm, accesses tree T each Leaf node can all obtain the part about secret ac and share qv(0), to each leaf node v ∈ lvs (T), t ← Z is chosenp, CalculateAnd Bv=gt, note private key sk=(T, Av,Bv)|v∈lvs(T))；
Step 3: the encryption to keyword and file address:(w, atts, ID (w)) data owner passes through trusted authority The hash function generation Bloom filter that center is sent, BF ← BFGen ({ H'1,…,H'k},{w1,…,wl), to containing key Word w data file address IDswAnd Bloom filter, SYMEnc() AES is encrypted, symmetric key sk1：
BFEnc=SYM (BF), (IDw)Enc=SYM (IDw)；
User data owner is to BFEnc(IDw)EncSigned：
To sk1It is encrypted with ABE () AES：C=ABE (sk1)；
After search terminates, attribute meets that the validated user can decryption C of access strategy obtains sk1, and then decrypt and obtain Take file destination；
Select r1,r2←Zp, calculateF=(f1,f2) wherein To each atj∈ Atts, calculateW is encrypted to obtain with the public key of serverIt can so remember that ciphertext keyword is：
Cph=(Atts, W', WE,W0,Wj,F,A,B,C)；
Step 4: generation search password (sk, w):Select s ← Zp, each leaf node v ∈ lvs (T) are calculatedSearching for password istok2=gcs, with the public key of server to tok2Added It is close：Remember tk=(tok1,(tok2)Enc,T,(A'v,B'v)|v∈lvs(T))；
Step 5: search (tk, cph)：Server chooses property set S to meet to search in password the visit specified from cph Tree is asked, if such set S is not present, returns to 0；Conversely, to each atj∈ S, calculate
With reference to (T, Ev| att (v) ∈ S), CalculateAnd thenServer decrypts W with the private key of oneselfE, (tok2)EncObtain W and tok2If e (W', tok1)Eroot=e (W, tok2), return to { W, F, A, B, C } and give user；Otherwise, only Return to A；
Step 6: checking { W, F, A, B, C }：After data user receives the search result of Cloud Server return, tested Card operation；
The receiving terminal includes：Wireless receiving module, deciphering chip, processing module；
Further, the optimal transmission power computational methods of the wireless receiving module include:CSU node is are when it is transmitted Gap tiIt is interior that idle channel can be accessed by the way of TDMA, and can be with speed in downlinkTransmit data, speed's Expression formula is：
Wherein ωiRepresent the Lagrange multiplier associated with CSU power；
Optimal transmission power assignment problem is formulated as equation group：
Wherein NCSURepresent the set of CSU nodes.
Advantages of the present invention and good effect are：It is connected to by computer between source terminal and purpose terminal, computer Mapping value into packet with communication port is led by the communication domain path control deivce inside manipulating, when communication domain route executor Configuration network node is carried out by packet, data transfer is controlled in diversification；It can also implement to encrypt, ensure the safety of data Property.
Brief description of the drawings
Fig. 1 is the structural representation of the allocation of computer device of signal communication bag provided in an embodiment of the present invention.
In figure：1st, transmitting terminal；2nd, computer；3rd, communication domain path control deivce；4th, encryption chip；5th, router；6th, receive Terminal；7th, wireless receiving module；8th, deciphering chip；9th, processing module；10th, wireless sending module.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to Limit the present invention.
The application principle of the present invention is explained in detail below in conjunction with the accompanying drawings.
As shown in figure 1, the allocation of computer device of signal communication bag provided in an embodiment of the present invention includes transmitting terminal 1, calculated Machine 2, communication domain path control deivce 3, encryption chip 4, router 5, receiving terminal 6, wireless receiving module 7, deciphering chip 8, place Manage module 9, wireless sending module 10.
The transmitting terminal 1 is by wire transmission signal to computer 2；
The computer 2 includes communication domain path control deivce 3, encryption chip 4.
The communication domain path control deivce 3 by inside manipulating leads the mapping value into packet with communication port, communication Domain path control deivce 3 carries out configuration network node by packet, then by the coded signal of encryption chip 4, then by signal root According to different network nodes and then router 5 is controlled, is transferred to receiving terminal 6；
The receiving terminal 6 includes wireless receiving module 7, deciphering chip 8, processing module 9；
The receiving router of wireless receiving module 7 is transmitted through the information come；
The deciphering chip 8 is used for decrypted signal；
The processing module 9 is used to, by signal transacting, use.
The wireless network user attribute private key generation：
Attribute authority (aa) mechanism unit using system public key PK and main private key MK as input, the user terminal decrypted as needed Attribute list L=(L1, L2..., Ln), wherein, n is the number of attribute in system, generates attribute private key SKLAnd it is sent to user Terminal；Specifically include：
The first step, attribute authority (aa) mechanism unit is in ZpIn randomly select r, r '1, r '2..., r 'nWith r "1, r "2..., r "n, Calculate
Second step, ifAttribute authority (aa) mechanism unit calculatesOtherwise Attribute authority (aa) mechanism unit calculatesWhereinIth attribute w in expression systemiNiIn individual value kiIndividual value,Represent attribute wiNegative value；
3rd step, attribute authority (aa) mechanism unit calculateMake Di=(DI, 1, DI, 2)；
4th step, attribute authority (aa) mechanism unit calculateMake Fi=(FI, 1, FI, 2)；
5th step, attribute authority (aa) mechanism unit make SKL=(L, D0, { Di, Fi}1≤i≤n)；
The router includes：Wireless sending module；Specific side of the router for the verification operation of encryption data Method is：
Step 1: the existence of search key：When data user only receives the A of Cloud Server return, use first The public key of data owner is verified to A；IfThen pass through checking；Operation is decrypted to C to obtain Take symmetric key sk1, decryption A obtains Bloom filter BF, if BFverify (w)=0, it is meant that is not present and uses on Cloud Server The keyword that family is searched for, conversely, rejecting returning result；
Step 2: the correctness of search key：When data user receives { W, F, A, B, C }, W/f is calculated1WithSuch as FruitIllustrate correctly, conversely, explanation is error result；
Step 3: the integrality of the data file address comprising keyword w：When data user demonstrates the correct of keyword After property, then B is verified, ifThen sk is obtained by decrypting C1, and then obtain number of targets According to file；
The encryption method of the router includes：
Trusted authority center operation RSA Algorithm is that Cloud Server and data owner generate public private key pair：{(n1,e1),d1} { (n2,e2),d2}；Data owner ensures the integrality of data file by digital signature；With the public key pair of Cloud Server Ciphertext keyword is re-encrypted to prevent the offline guessing attack of external attacker, when data owner uses SYMEnc() encrypts Algorithm returns to the address of encryption file, is designated as ID { F to being contracted out to Cloud Server, server after data file encryptioni, so wrap The data file of the w containing keyword is represented by IDw=ID { F1}||ID{F2}…||ID{Fi}；Specifically include：
Step 1: initialization (1l)：Trusted authority center selects Bilinear map：e:G×G→GT, G and GTIt is that rank is following for p Ring group, p are the primitive element of l bit longs, select the hash function under random oracle
H1:{0,1}*→G；H2:{0,1}*→ZpIt is one-way Hash function, selects a, b, c ← Zp, g ← G,
Pm=(H1,H2,e,g,p,ga,gb,gc,G,GT),
Mk=(a, b, c)
Then k independent hash function H' are chosen1,…,H'k, for the Bloom filter BF of the construction m bits of m bits Data owner is sent to, is that data owner and Cloud Server generate public private key pair { (n1,e1),d1And { (n2,e2),d2}；
Step 2: key generation (mk, T)：Trusted authority center performs Share (T, ac) algorithm, accesses tree T each Leaf node can all obtain the part about secret ac and share qv(0), to each leaf node v ∈ lvs (T), t ← Z is chosenp, CalculateAnd Bv=gt, note private key sk=(T, Av,Bv)|v∈lvs(T))；
Step 3: the encryption to keyword and file address:(w, atts, ID (w)) data owner passes through trusted authority The hash function generation Bloom filter that center is sent, BF ← BFGen ({ H'1,…,H'k},{w1,…,wl), to containing key Word w data file address IDswAnd Bloom filter, SYMEnc() AES is encrypted, symmetric key sk1：
BFEnc=SYM (BF), (IDw)Enc=SYM (IDw)；
User data owner is to BFEnc(IDw)EncSigned：
To sk1It is encrypted with ABE () AES：C=ABE (sk1)；
After search terminates, attribute meets that the validated user can decryption C of access strategy obtains sk1, and then decrypt and obtain Take file destination；
Select r1,r2←Zp, calculateF=(f1,f2) wherein To each atj∈ Atts, calculateW is encrypted to obtain with the public key of serverIt can so remember that ciphertext keyword is：
Cph=(Atts, W', WE,W0,Wj,F,A,B,C)；
Step 4: generation search password (sk, w):Select s ← Zp, each leaf node v ∈ lvs (T) are calculatedSearching for password istok2=gcs, with the public key of server to tok2It is encrypted：Remember tk=(tok1,(tok2)Enc,T,(A'v,B'v)|v∈lvs(T))；
Step 5: search (tk, cph)：Server chooses property set S to meet to search in password the visit specified from cph Tree is asked, if such set S is not present, returns to 0；Conversely, to each atj∈ S, calculate
With reference to (T, Ev| att (v) ∈ S), CalculateAnd thenServer decrypts W with the private key of oneselfE, (tok2)EncObtain W and tok2If e (W', tok1)Eroot=e (W, tok2), return to { W, F, A, B, C } and give user；Otherwise, only Return to A；
Step 6: checking { W, F, A, B, C }：After data user receives the search result of Cloud Server return, tested Card operation.
The optimal transmission power computational methods of the wireless receiving module include:CSU node is are in its transmission time slot tiInterior meeting Idle channel is accessed by the way of TDMA, and can be with speed in downlinkTransmit data, speedExpression formula be：
Wherein ωiRepresent the Lagrange multiplier associated with CSU power；
Optimal transmission power assignment problem is formulated as equation group：
Wherein NCSURepresent the set of CSU nodes.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention All any modification, equivalent and improvement made within refreshing and principle etc., should be included in the scope of the protection.

Claims (2)

  1. A kind of 1. allocation of computer device of signal communication bag, it is characterised in that the allocation of computer device bag of the signal communication bag Include：Transmitting terminal, computer, router, receiving terminal；
    Transmitting terminal is connected by wireless network with computer, and computer is connected by netting twine with router, and router passes through wireless Network and the connection received；
    The wireless network user attribute private key generation：
    Attribute authority (aa) mechanism unit is using system public key PK and main private key MK as input, the attribute for the user terminal decrypted as needed List L=(L1, L2..., Ln), wherein, n is the number of attribute in system, generates attribute private key SKLAnd it is sent to user terminal； Specifically include：
    The first step, attribute authority (aa) mechanism unit is in ZpIn randomly select r, r '1, r '2..., r 'nWith r "1, r "2..., r "n, calculate
    Second step, ifAttribute authority (aa) mechanism unit calculatesOtherwiseAttribute Weight Prestige mechanism unit calculatesWhereinIth attribute w in expression systemiNiKth in individual valueiIndividual value,Represent attribute wiNegative value；
    3rd step, attribute authority (aa) mechanism unit calculateMake Di=(DI, 1, DI, 2)；
    4th step, attribute authority (aa) mechanism unit calculateMake Fi=(FI, 1, FI, 2)；
    5th step, attribute authority (aa) mechanism unit make SKL=(L, D0, { Di, Fi}1≤i≤n)；
    The computer includes communication domain path control deivce, encryption chip；
    The router includes：Wireless sending module；The router is for the specific method of the verification operation of encryption data：
    Step 1: the existence of search key：When data user only receives the A of Cloud Server return, data are used first The public key of owner is verified to A；IfThen pass through checking；C is decrypted operation acquisition pair Claim key sk1, decryption A obtains Bloom filter BF, if BFverify (w)=0, it is meant that user institute is not present on Cloud Server The keyword of search, conversely, rejecting returning result；
    Step 2: the correctness of search key：When data user receives { W, F, A, B, C }, W/f is calculated1WithIfIllustrate correctly, conversely, explanation is error result；
    Step 3: the integrality of the data file address comprising keyword w：When data user demonstrates the correctness of keyword Afterwards, then B is verified, ifThen sk is obtained by decrypting C1, and then obtain target data File；
    The encryption method of the router includes：
    Trusted authority center operation RSA Algorithm is that Cloud Server and data owner generate public private key pair：{(n1,e1),d1And {(n2,e2),d2}；Data owner ensures the integrality of data file by digital signature；With the public key of Cloud Server to close Literary keyword is re-encrypted to prevent the offline guessing attack of external attacker, when data owner uses SYMEnc() encryption is calculated Method returns to the address of encryption file, is designated as ID { F to being contracted out to Cloud Server, server after data file encryptioni, so include Keyword w data file is represented by IDw=ID { F1}||ID{F2}…||ID{Fi}；Specifically include：
    Step 1: initialization (1l)：Trusted authority center selects Bilinear map：e:G×G→GT, G and GTIt is the circulation that rank is p Group, p are the primitive element of l bit longs, select the hash function under random oracle
    H1:{0,1}*→G；H2:{0,1}*→ZpIt is one-way Hash function, selects a, b, c ← Zp, g ← G,
    Pm=(H1,H2,e,g,p,ga,gb,gc,G,GT),
    Mk=(a, b, c)
    Then k independent hash function H ' are chosen1,…,H'k, for the Bloom filter BF transmissions of the construction m bits of m bits It is that data owner and Cloud Server generate public private key pair { (n to data owner1,e1),d1And { (n2,e2),d2}；
    Step 2: key generation (mk, T)：Trusted authority center performs Share (T, ac) algorithm, accesses tree T each leaf Node can all obtain the part about secret ac and share qv(0), to each leaf node v ∈ lvs (T), t ← Z is chosenp, calculateAnd Bv=gt, note private key sk=(T, Av,Bv)|v∈lvs(T))；
    Step 3: the encryption to keyword and file address:(w, atts, ID (w)) data owner passes through trusted authority center The hash function generation Bloom filter of transmission, BF ← BFGen ({ H '1,…,H'k},{w1,…,wl), to containing keyword w Data file address IDwAnd Bloom filter, SYMEnc() AES is encrypted, symmetric key sk1：
    BFEnc=SYM (BF), (IDw)Enc=SYM (IDw)；
    User data owner is to BFEnc(IDw)EncSigned：
    To sk1It is encrypted with ABE () AES：C=ABE (sk1)；
    After search terminates, attribute meets that the validated user can decryption C of access strategy obtains sk1, and then decrypt and obtain target File；
    Select r1,r2←Zp, calculateF=(f1,f2) wherein To each atj∈ Atts, calculateW is encrypted to obtain with the public key of serverIt can so remember that ciphertext keyword is：
    Cph=(Atts, W', WE,W0,Wj,F,A,B,C)；
    Step 4: generation search password (sk, w):Select s ← Zp, each leaf node v ∈ lvs (T) are calculated Searching for password istok2=gcs, with the public key of server to tok2It is encrypted： Remember tk=(tok1,(tok2)Enc,T,(A′v,B′v)|v∈lvs(T))；
    Step 5: search (tk, cph)：Server chooses property set S to meet to search in password the access tree specified from cph, If such set S is not present, 0 is returned；Conversely, to each atj∈ S, calculate
    With reference to (T, Ev| att (v) ∈ S), meter CalculateAnd thenServer decrypts W with the private key of oneselfE, (tok2)EncObtain W and tok2If e (W', tok1)Eroot=e (W, tok2), return to { W, F, A, B, C } and give user；Otherwise, only Return to A；
    Step 6: checking { W, F, A, B, C }：After data user receives the search result of Cloud Server return, checking behaviour is carried out Make；
    The receiving terminal includes：Wireless receiving module, deciphering chip, processing module.
  2. 2. the allocation of computer device of signal communication bag as claimed in claim 1, it is characterised in that the wireless receiving module Optimal transmission power computational methods include:CSU node is are in its transmission time slot tiIt is interior that idle letter can be accessed by the way of TDMA Road, and can be with speed in downlinkTransmit data, speedExpression formula be：
    <mrow> <mtable> <mtr> <mtd> <mrow> <msubsup> <mi>v</mi> <mi>i</mi> <mi>C</mi> </msubsup> <mo>=</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>L</mi> <mi>C</mi> </msub> </mrow> </munder> <msub> <mi>t</mi> <mi>i</mi> </msub> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mrow> <msubsup> <mi>H</mi> <mrow> <mi>C</mi> <mo>,</mo> <mi>i</mi> </mrow> <mi>j</mi> </msubsup> <mo>&amp;CenterDot;</mo> <msup> <mrow> <mo>(</mo> <mrow> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>b</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msubsup> <mi>X</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>b</mi> </mrow> <mi>j</mi> </msubsup> </mrow> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>&amp;times;</mo> <mrow> <mo>(</mo> <mrow> <msub> <mi>&amp;omega;</mi> <mi>i</mi> </msub> <mi>I</mi> <mo>+</mo> <msub> <mi>&amp;lambda;</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>L</mi> <mi>C</mi> </msub> </mrow> </munder> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>b</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msubsup> <mi>X</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>b</mi> </mrow> <mi>j</mi> </msubsup> </mrow> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> <mo>;</mo> </mrow>
    Wherein ωiRepresent the Lagrange multiplier associated with CSU power；
    Optimal transmission power assignment problem is formulated as equation group：
    <mrow> <mtable> <mtr> <mtd> <munder> <mi>max</mi> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>N</mi> <mrow> <mi>C</mi> <mi>S</mi> <mi>U</mi> </mrow> </msub> </mrow> </munder> </mtd> <mtd> <msubsup> <mi>v</mi> <mi>i</mi> <mi>C</mi> </msubsup> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>s</mi> <mo>.</mo> <mi>t</mi> <mrow> <mo>(</mo> <mrow> <mi>F</mi> <mn>1</mn> </mrow> <mo>)</mo> </mrow> <mo>:</mo> </mrow> </mtd> <mtd> <mrow> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>L</mi> <mi>C</mi> </msub> </mrow> </munder> <mo>|</mo> <msubsup> <mi>H</mi> <mrow> <mi>C</mi> <mo>,</mo> <mi>i</mi> </mrow> <mi>j</mi> </msubsup> <mo>|</mo> <mo>&amp;le;</mo> <msubsup> <mi>P</mi> <mi>max</mi> <mrow> <mi>C</mi> <mo>,</mo> <mi>i</mi> </mrow> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow> <mo>(</mo> <mrow> <mi>F</mi> <mn>2</mn> </mrow> <mo>)</mo> </mrow> <mo>:</mo> </mrow> </mtd> <mtd> <mrow> <msubsup> <mi>I</mi> <mi>m</mi> <mrow> <mi>C</mi> <mi>S</mi> <mi>U</mi> </mrow> </msubsup> <mo>&amp;le;</mo> <munder> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>L</mi> <mi>C</mi> </msub> </mrow> </munder> <mo>|</mo> <msubsup> <mi>H</mi> <mrow> <mi>C</mi> <mo>,</mo> <mi>i</mi> </mrow> <mi>j</mi> </msubsup> <mo>|</mo> <mo>&amp;CenterDot;</mo> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>b</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <mo>|</mo> <msubsup> <mi>X</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>b</mi> </mrow> <mi>j</mi> </msubsup> <mo>|</mo> </mrow> </mtd> </mtr> </mtable> <mo>;</mo> </mrow>
    Wherein NCSURepresent the set of CSU nodes.
CN201710562999.2A 2017-07-11 2017-07-11 A kind of allocation of computer device of signal communication bag Pending CN107342900A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710562999.2A CN107342900A (en) 2017-07-11 2017-07-11 A kind of allocation of computer device of signal communication bag

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710562999.2A CN107342900A (en) 2017-07-11 2017-07-11 A kind of allocation of computer device of signal communication bag

Publications (1)

Publication Number Publication Date
CN107342900A true CN107342900A (en) 2017-11-10

Family

ID=60219230

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710562999.2A Pending CN107342900A (en) 2017-07-11 2017-07-11 A kind of allocation of computer device of signal communication bag

Country Status (1)

Country Link
CN (1) CN107342900A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110320809A1 (en) * 2010-06-23 2011-12-29 Motorola, Inc. Method and apparatus for key revocation in an attribute-based encryption scheme
CN104636292A (en) * 2013-11-10 2015-05-20 西安汉威数控设备有限公司 Computer configuration device for signal communication package
CN104993929A (en) * 2015-05-15 2015-10-21 西安邮电大学 Attribute-based encryption system and method supporting system attribute expansion
CN104038349B (en) * 2014-07-03 2017-05-03 西安电子科技大学 Effective and verifiable public key searching encryption method based on KP-ABE

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110320809A1 (en) * 2010-06-23 2011-12-29 Motorola, Inc. Method and apparatus for key revocation in an attribute-based encryption scheme
CN104636292A (en) * 2013-11-10 2015-05-20 西安汉威数控设备有限公司 Computer configuration device for signal communication package
CN104038349B (en) * 2014-07-03 2017-05-03 西安电子科技大学 Effective and verifiable public key searching encryption method based on KP-ABE
CN104993929A (en) * 2015-05-15 2015-10-21 西安邮电大学 Attribute-based encryption system and method supporting system attribute expansion

Similar Documents

Publication Publication Date Title
CN113626484B (en) Encryption method, system and computer equipment capable of flexibly replacing ciphertext and searching
CN107070652B (en) A kind of car networking method for secret protection that the ciphertext based on CP-ABE is anti-tamper and system
CN104038349B (en) Effective and verifiable public key searching encryption method based on KP-ABE
CN104253694B (en) A kind of time slot scrambling for network data transmission
CN100525181C (en) Encrypted information pack processing apparatus and method
CN101834840B (en) There is efficient key derivation system, the method and apparatus for end-to-end network security of business visuality
CN105337736B (en) Full homomorphism message authentication method, apparatus and system
CN109086615A (en) A kind of support multiple key search public key encryption method of anti-keyword guessing attack
CN103457722B (en) Bidirectional identity authentication and data safety transmission providing body area network safety method based on Shamir threshold
CN105635135B (en) A kind of encryption system and access control method based on property set and relationship predicate
CN102780698A (en) User terminal safety communication method in platform of Internet of Things
KR20090058496A (en) A method and apparatus to provide authentication and privacy with low complexity devices
CN104468612B (en) The Attribute Matching Approach of the protection privacy based on symmetric cryptography
CN108347404A (en) A kind of identity identifying method and device
CN109787761A (en) A kind of equipment certification and key distribution system and method based on physics unclonable function
EP3673610B1 (en) Computer-implemented system and method for highly secure, high speed encryption and transmission of data
CN106878322B (en) A kind of encryption and decryption method of fixed length ciphertext and key based on attribute
Bhandari et al. Enhanced encryption technique for secure iot data transmission
CN107294696A (en) For the full homomorphism method for distributing key of Leveled
CN111600711A (en) Encryption and decryption system and encryption and decryption method for fine-grained mobile access
CN109818752A (en) Credit scoring generation method, device, computer equipment and storage medium
WO2014030706A1 (en) Encrypted database system, client device and server, method and program for adding encrypted data
CN105721146A (en) Big data sharing method for cloud storage based on SMC
CN103001957A (en) Key generation method, device and server
CN107342900A (en) A kind of allocation of computer device of signal communication bag

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Xue Geli

Inventor after: Wang Wanping

Inventor after: Wang Honglei

Inventor after: Wang Jing

Inventor after: Huang Zhaoji

Inventor before: Chen Huanying

Inventor before: Wang Wanping

Inventor before: Cui Dong

Inventor before: Sun Peishuo

Inventor before: Wang Honglei

Inventor before: Wang Jing

TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20171219

Address after: No. 5, courtyard No. 1, courtyard 23, Shuguang street, Xinhua District, Xinhua District, Henan Province

Applicant after: Xue Geli

Address before: No. 5, courtyard No. 1, courtyard 23, Shuguang street, Xinhua District, Xinhua District, Henan Province

Applicant before: Chen Huanying

RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20171110