搜索结果: 1-15 共查到“密码学 Puzzles”相关记录17条 . 查询时间(0.125 秒)
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...
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...
Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection
client puzzles time-lock puzzles denial of service resistance
2012/8/28
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...
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
client puzzles proof of work denial of service resistance protocols
2010/12/22
Client puzzles are meant to act as a defense against denial of service (DoS) attacks by requiring a client to solve some moderately hard problem before being granted access to a resource. However, rec...
Efficient Client Puzzles based on Repeated-Squaring
Efficient Client Puzzles Repeated-Squaring
2009/12/29
In this paper, we propose a new, nonparallelizable
verification-efficient client puzzle. Our
puzzle is based on repeated-squaring and enables efficient
verification of the puzzle solution that is r...
Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles
Denial of Service (DoS) Attack Proof-of-Work Nash Equilibrium
2009/7/22
Denial of Service (DoS) vulnerabilities are one of the major
concerns in today's Internet. Client-puzzles o er a good mechanism to
defend servers against DoS attacks. In this paper, we introduce the...
Security Notions and Generic Constructions for Client Puzzles
Security Notions Generic Constructions Client Puzzles
2009/7/14
Computational puzzles are mildly difficult computational problems that require resources (processor
cycles, memory, or both) to solve. Puzzles have found a variety of uses in security. In this paper ...