摘要:
The bread pudding protocol of the present invention represents a novel use of proofs of work and is based upon the same principle as the dish from which it takes its name, namely, that of reuse to minimize waste. Whereas the traditional bread pudding recipe recycles stale bread, our bread pudding protocol recycles the “stale” computations in a POW to perform a separate and useful task, while also maintaining privacy in the task. In one advantageous embodiment of our bread pudding protocol, we consider the computationally intensive operation of minting coins in the MicroMint scheme of Rivest and Shamir and demonstrate how the minting operation can be partitioned into a collection of POWs, which are then used to shift the burden of the minting operation onto a large group of untrusted computational devices. Thus, the computational effort invested in the POWs is recycled to accomplish the minting operation.
摘要:
A method for secure multiparty computation is disclosed. In one embodiment, participants to a secure computation agree upon a function to be computed and a representation of the function as a circuit with at least one gate. Logical tables are then generated for each gate. A logical table includes all possible input and output values for the gate based on the function. These input and output values are then encoded and the encoded tables are passed through a mix network, which generates a blinded table for each encoded logical table. A blinded table corresponds to the encoded logical table except that its rows are randomly permuted and entries are encrypted. After this initial blinding round, participants provide encryptions of their encoded secret inputs. The participants then jointly compute the function of interest using the encrypted secret inputs and the representative circuit. To simulate a gate therein, the participants compare the encrypted inputs to the gate with each encrypted input entry in the blinded table until a match is detected. When a match is detected, the corresponding output entry in the matched row is taken to be the output of the gate. This method of mixing and matching is performed in an identical manner for every gate in the circuit, irrespective of the layer in which it resides or the function being computed, until the output of the last gate is identified.
摘要:
A highly efficient mix network for small numbers of inputs is provided. Four data messages would be a typical number of inputs. The structure of sorting/permutation networks is used to permute the input. This is done in a way that changes the position of pairs of items. A mix network is provided which is highly efficient on small input batches and is robust and private in the face of collusion by any minority set of mix servers. Additionally, the mix network method and apparatus has the feature of being publicly verifiable because the mixing method yields a transcript of results that can demonstrate to a third party that the mix proceeded correctly. An apparatus comprised of a plurality of mix servers is provided. Each mix server includes a randomizer network. Each randomizer network receives a plurality of input data messages and performs re-encryption and permutation operations on the plurality of input data messages to form a plurality of output data messages. The randomizer networks of the plurality of mix servers are arranged in a chain so that the first randomizer network of the first mix server in the chain receives its plurality of input data messages and provides its plurality of output data messages to the next randomizer network of the following mix server in the chain. Each randomizer network is comprised of a plurality of randomizers, wherein each randomizer receives first and second input data messages and produces first and second output data messages, wherein the first output data message is a re-encryption of either the first or the second input data message and the second output data message is a re-encryption of the other input data message. A bulletin board having computer memory may be provided, to which each mix server produces proof that each randomizer of each randomizer network has re-encrypted and permuted in a proper manner.
摘要:
The invention provides techniques for implementing secure transactions using an instrument referred to as "executable digital cash." In an illustrative embodiment, a first user generates a piece of digital cash representing an offer made by that user. The piece of digital cash includes a digital certificate authorizing the first user to make specified transfers, and an offer program characterizing the offer. The piece of digital cash is broadcast or otherwise transmitted to one or more additional users, utilizing a mobile agent or other suitable mechanism, such that a given one of these users can evaluate the offer using the offer program. For example, a second user could execute the offer program with a specific bid as an input to determine what that user would receive upon acceptance of his bid. If the result is acceptable to the second user, that user generates a bid capsule including the bid, the corresponding output of the offer program, and another certificate authorizing the second user to make the transfer specified in the bid. The bid capsule is submitted to an institution for processing in accordance with a policy which may be specified in the piece of digital cash. The institution selects one or more winning bids and implements the corresponding transactions. Digital signatures generated using secret keys associated with the certificates of the first and second users are utilized to ensure adequate security for the transmitted offer and bid information.
摘要:
Disclosed is a method and apparatus for performing steps to cause encoded information to be stored at a client device during a first network session between a server and the client device. To cause encoded information to be stored at a client device, the server first determines a set of network resource requests that encode the information. These network resource requests may include requests for one or more specific URLs and/or requests for one or more files. The server then causes the client device to initiate the network resource requests. The server may cause this initiation by, for example, redirecting the client device to the network resources. The client device initiating the network resource requests causes data representative of the network resource requests to be stored at the client device.
摘要:
Disclosed is a method and apparatus for combatting click fraud. In a system including a first entity, a second entity, a third entity, and a fourth entity, the first entity performs a transaction with the second entity. The transaction between the first entity and the second entity may be an on-line purchase by a client device from an attestor. The second entity causes an integrity-protected classification value to be created. The integrity-protected classification value is derived at least in part from behavioral data about the first entity, and data associated with the classification value is stored in a data repository of the first entity. The first entity then performs a transaction with the third entity, and the transaction causes the stored data to be released to the fourth entity. The fourth entity computes a compensation for the third entity.
摘要:
The invention generates a random bit string from a sequence of readings taken from a potentially biased source of randomness, such as a random stationary source which can be represented as a biased die. A simulated unbiased source is generated from the potentially biased source, and a reading is taken from the simulated unbiased source. The reading is then converted to a bit string. Taking a reading from the simulated unbiased source may involve generating an integer pair (R,S), which depends on the sequence of readings from the random source, and represents a roll of value R on a simulated unbiased die U with S sides. The pair (R,S) is then converted into an output bit string bkbk−1 . . . b1 which is unbiased over sequences of readings from the random source.
摘要:
A verifying entity of a decentralized system is configured to receive information associated with at least one ledger entry of a distributed ledger of the decentralized system, to verify at least a portion of one or more computations associated with the received information, to generate evidence of at least one error in the at least a portion of the one or more computations associated with the received information, and to associate the generated evidence with a public key of the verifying entity. The decentralized system may comprise a proof of space based mining system, and the at least one ledger entry of the distributed ledger may comprise at least one proof of space for the proof of space based mining system.
摘要:
Techniques for reducing fraud are disclosed. A transaction request is received from a user to perform a transaction using an account. In one approach, a source icon is displayed prior to executing the request. The source icon includes a graphical representation of an owner of the account. In another approach, at least one of a photograph and a voice of the user is recorded prior to executing the request. In a third approach, the user is informed that at least one of a photograph, a voice print, and location data will be taken prior to executing the transaction request.
摘要:
Systems, methods, and devices for authenticating a user are provided. A device includes one or more processors configured to determine if a requested service requires high quality authentication, generate a request for high quality authentication if the requested service requires high quality authentication, and generate a request for low quality authentication if the requested service requires low quality authentication. The device also include a network interface component coupled to a network, the network interface component configured to: receive the request for the service requiring authentication, and a memory, the memory storing high quality authentication information and low quality authentication information for authenticating the user.