搜索结果: 1-15 共查到“Puzzles”相关记录31条 . 查询时间(0.14 秒)
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
Fully-Homomorphic Encryption High-Rate Time-Lock Puzzles
2019/6/19
We show how to combine a fully-homomorphic encryption scheme with linear decryption and a linearly-homomorphic encryption schemes to obtain constructions with new properties. Specifically, we present ...
Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a puzzle with a solution ss that remains hidden until time TT has elapsed. The solution is required to be conc...
Designing Proof of Transaction Puzzles for Cryptocurrency
proof of transaction sequential aggregate signature blockchain
2017/12/25
One of the Bitcoin's innovations is the Proof of Work puzzle (aka scratch-off puzzle) as a consensus protocol for anonymous networks without pre-established PKI. Bitcoins based on the Proof of Work pu...
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles
Non-malleable Commitments Time-lock Puzzles Two-round
2017/3/27
Non-malleable commitment is a fundamental cryptographic tool for preventing man-in-the-middle attacks. Since its proposal by Dolev, Dwork, and Noar in 1991, a rich line of research has steadily reduce...
Fair Client Puzzles from the Bitcoin Blockchain
Bitcoin Client Puzzles Denial of Service Resistance
2016/7/7
Client puzzles have been proposed as a mechanism for proving legitimate intentions by providing ``proofs of work'', which can be applied to discourage malicious usage of resources. A typical problem o...
Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond
Virginia Commonwealth University
2016/2/23
We introduce the novel notion of a Proof of Human-work (PoH) and present the first distributed
consensus protocol from hard Artificial Intelligence problems. As the name suggests, a PoH is a proof
t...
Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles
computational puzzles distributed systems consensus
2016/1/6
In standard models of distributed computation, point-to-point channels
between parties are assumed to be authenticated by some preexisting
means. In other cases, even stronger pre-existing setup—e.g...
Time-Lock Puzzles from Randomized Encodings
2015/12/30
Time-lock puzzles are a mechanism for sending messages “to the future”. A sender can
quickly generate a puzzle with a solution s that remains hidden until a moderately large
amount of time t has ela...
The anatomy of a tornillo: puzzles from three-component measurements at Galeras volcano (Colombia)
Galeras tornillo polarizations analytic function parametrization
2015/10/8
Many of the recent ash eruptions of Galeras volcano (Colombia) have been preceded by tornillos. These unusual seismic events of unknown origin have screw-like profiles on seismograms and can last up t...
Solving Logic Puzzles:From Robust Processing to Precise Semantics
Solving Logic Puzzles Robust Processing Precise Semantics
2015/6/12
This paper presents intial work on a system that bridges from robust, broad-coverage natural language processing to precise semantics and automated reasoning, focusing on solving logic puzzles drawn f...
Etiquette and Process Puzzles of Negotiating Business in China:A Questionnaire
Decision Making Cross-Cultural and Cross-Border Issues Governance Questionnaires Negotiation Process Behavior China
2015/4/21
Cultural differences can affect negotiations in many ways, from influencing the basic motivations and perceptions of the players to guiding the surface aspects, such as etiquette, protocol, and proces...
My father believed in education, and he liked to measure things. He grew up in a mining village in Yorkshire, between the first and second World Wars. He was bright and motivated, but the school syste...
ECONOMIC ANALYSIS OF SUBJECTIVE WELL-BEING——Two Happiness Puzzles
ECONOMIC ANALYSIS SUBJECTIVE WELL-BEING Two Happiness Puzzles
2014/3/17
Economists, as well as psychologists and philosophers, have become increasingly interested in self-reported measures of well-being, what they mean, and whether they might be used for policymaking. Thi...
Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection
client puzzles time-lock puzzles enial of service resistance
2012/6/14
Client puzzles are moderately-hard cryptographic problems --- neither easy nor impossible to solve --- that can be used as a countermeasure against denial of service attacks on network protocols. Puzz...
Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection
client puzzles time-lock puzzles denial of service resistance RSA puzzle difficulty
2012/3/20
Client puzzles are moderately-hard cryptographic problems --- neither easy nor impossible to solve --- that can be used as a countermeasure against denial of service attacks on network protocols. Puzz...