Skip to search formSkip to main contentSkip to account menu

The Bitcoin Backbone Protocol: Analysis and Applications

This work extracts and analyzes the core of the Bitcoin protocol, which is term the Bitcoin backbone, and proves two of its fundamental properties which are called common prefix and chain quality in the static setting where the number of players remains fixed.
View via Publisher (opens in a new tab)

Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol

“Ouroboros” is presented, the first blockchain protocol based on proof of stake with rigorous security guarantees and it is proved that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining.
View via Publisher (opens in a new tab)

Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain

Ouroboros Praos is a proof-of-stake blockchain protocol that provides security against fully-adaptive corruption in the semi-synchronous setting and tolerates an adversarially-controlled message delivery delay unknown to protocol participants.
View via Publisher (opens in a new tab)

Delegatable pseudorandom functions and applications

Two DPRF constructions are built upon the well-known tree-based GGM PRF family and feature only logarithmic delegation size in the number of values conforming to the policy predicate, and it is shown that the second construction is also policy private.
View on ACM (opens in a new tab)

Robust key generation from signal envelopes in wireless networks

This paper presents a novel approach that couples the physical layer characteristics of wireless networks with key generation algorithms based on the wireless communication phenomenon known as the principle of reciprocity which states that in the absence of interference both transmitter and receiver experience the same signal envelope.
View on ACM (opens in a new tab)

Self-tallying Elections and Perfect Ballot Secrecy

  • A. KiayiasM. Yung
  • Computer Science
    International Conference on Theory and Practice…
  • 12 February 2002
This work introduces a new election paradigm with strong voter privacy as its primary objective, and presents a novel voting scheme which is the first system that is dispute-free, self-tallying and supports perfect ballot secrecy.
View via Publisher (opens in a new tab)

Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability

A novel Proof-of-Stake protocol, Ouroboros Genesis, that enables parties to safely join (or rejoin) the protocol execution using only the genesis block information, and proves the security of the construction against an adaptive adversary.
View on ACM (opens in a new tab)

Traceable Signatures

This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation, and develops the underlying mathematical and protocol tools, and realizes the scheme and its security proof.
View via Publisher (opens in a new tab)

Scalability, fidelity and stealth in the DRAKVUF dynamic malware analysis system

DRAKVUF is presented, a novel dynamic malware analysis system designed to address these challenges by building on the latest hardware virtualization extensions and the Xen hypervisor and providing a stealthy, in-depth view into the behavior of modern malware.
View on ACM (opens in a new tab)

Anonymous Identification in Ad Hoc Groups

This work provides a formal model for Ad hoc Anonymous Identification schemes and design secure such schemes both generically (based on any accumulator with one-way domain) and for a specific efficient implementation of such an accumulator based on the Strong RSA Assumption.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)