Secure Signature Protocol (Report) Secure Signature Protocol (Report)

Secure Signature Protocol (Report‪)‬

Intelligent Information Management 2009, Dec, 1, 3

    • $5.99
    • $5.99

Publisher Description

1. Introduction Feigenbaum proposes the following problem [1]: Alice has a function f() and a its instance x. She needs to compute f(x), but does not have the corresponding computing resources, or because she is too lazy to do the computing. The sources here are in general sense which includes the computing time, algorithmic knowledge or corresponding hardware. If Bob has the corresponding resources, can she take advantage of Bob's resources without trust him? That is, can she use Bob's resources to compute f(x) without letting Bob know x and f(x)?

GENRE
Computers & Internet
RELEASED
2009
December 1
LANGUAGE
EN
English
LENGTH
14
Pages
PUBLISHER
Scientific Research Publishing, Inc.
SELLER
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
SIZE
159.1
KB
Information Security Practice and Experience Information Security Practice and Experience
2008
Privately and Publicly Verifiable Computing Techniques Privately and Publicly Verifiable Computing Techniques
2017
Cryptography in the Information Society Cryptography in the Information Society
2020
Applied Cryptography and Network Security Applied Cryptography and Network Security
2007
Information Security Information Security
2007
New Directions of Modern Cryptography New Directions of Modern Cryptography
2012
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines. Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines.
2010
Policy Research in a Complex Context (Report) Policy Research in a Complex Context (Report)
2010
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report) Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
2010
How to Make Highly Rational Use of Modern Educational Technologies (Report) How to Make Highly Rational Use of Modern Educational Technologies (Report)
2010
Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report) Simulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines (Report)
2011
Data Mining Technology Across Academic Disciplines (Report) Data Mining Technology Across Academic Disciplines (Report)
2011