搜索结果: 1-15 共查到“密码学 foundations”相关记录20条 . 查询时间(0.046 秒)
Omniring: Scaling Up Private Payments Without Trusted Setup - Formal Foundations and Constructions of Ring Confidential Transactions with Log-size Proofs
Ring Confidential Transactions Log-size Proofs
font style='font-size:12px;'>
2019/5/31
Monero is the largest cryptocurrency with built-in cryptographic privacy features. The transactions are authenticated using spend proofs, which provide a certain level of anonymity by hiding the sourc...
Foundations of State Channel Networks
state channels cryptocurrencies blockchain
font style='font-size:12px;'>
2018/4/9
One of the main challenges that hinder further adaption of decentralized cryptocurrencies is scalability. Because current cryptocurrencies require that all transactions are processed and stored on a d...
Onion-AE: Foundations of Nested Encryption
Anonymity authenticated encryption onion routing
font style='font-size:12px;'>
2018/2/6
Nested symmetric encryption is a well-known technique for low-latency communication privacy. But just what problem does this technique aim to solve? In answer, we provide a provable-security treatment...
Foundations of Homomorphic Secret Sharing
homomorphic secret sharing, secure computation, communication complexity
font style='font-size:12px;'>
2018/1/2
Homomorphic secret sharing (HSS) is the secret sharing analogue of homomorphic encryption. An HSS scheme supports a local evaluation of functions on shares of one or more secret inputs, such that the ...
Privacy Notions for Privacy-Preserving Distributed Data Mining: Foundations and Privacy Games
privacy privacy games privacy notions
font style='font-size:12px;'>
2017/11/27
It is well understood that the huge volumes of data captured in recent years have the potential to underpin significant research developments in many fields. But, to realise these benefits, all releva...
Foundations of Differentially Oblivious Algorithms
ORAM differential obliviousness
font style='font-size:12px;'>
2017/10/30
It is well-known that a program's memory access pattern can leak information about its input. To thwart such leakage, most existing works adopt the solution of oblivious RAM (ORAM) simulation. Such a ...
Foundations for Actively Secure Card-based Cryptography
Card-based protocols Card shuffling Secure multiparty computation
font style='font-size:12px;'>
2017/5/23
Starting with the so-called “Five-Card Trick” of den Boer (EUROCRYPT 1989) for computing the AND of two players' bits, a version of secure multiparty computation in which a deck of playing cards repla...
Automatically Detecting the Misuse of Secrets: Foundations, Design Principles, and Applications
cryptographic protocols Design Principles
font style='font-size:12px;'>
2017/3/13
We develop foundations and several constructions for security protocols that can automatically detect, without false positives, if a secret (such as a key or password) has been misused. Such construct...
Multi-Prover Interactive Proofs: Unsound Foundations
cryptographic protocols Zero-Knowledge
font style='font-size:12px;'>
2017/3/9
Several Multi-Prover Interactive Proofs (MIPs) found in the literature contain proofs of soundness that are lacking. This was first observed by Crépeau, Salvail, Simard and Tapp who defined a notion o...
Foundations of Fully Dynamic Group Signatures
Group Signatures Security Definitions
font style='font-size:12px;'>
2016/4/13
Group signatures are a central cryptographic primitive that
has received a considerable amount of attention from the cryptographic
community. They allow members of a group to anonymously sign on beh...
Semantically Secure Anonymity: Foundations of Re-encryption
probabilistic re-encryption key anonymity anonymous communication
font style='font-size:12px;'>
2016/4/6
The notion of universal re-encryption is an established primitive used in the design of many anonymity protocols. It allows anyone to randomize a ciphertext without changing its size, without decrypti...
Foundations of Hardware-Based Attested Computation and Application to SGX
isolated execution environments trusted hardware attestation
font style='font-size:12px;'>
2016/1/27
Exciting new capabilities of modern trusted hardware technologies allow for the execution
of arbitrary code within environments completely isolated from the rest of the
system and provide cryptograp...
Foundations of Reconfigurable PUFs
Physically Unclonable Functions Logically Reconfigurable Tamper-resistance
font style='font-size:12px;'>
2015/12/31
A Physically Unclonable Function (PUF) can be seen as a
source of randomness that can be challenged with a stimulus and responds
in a way that is to some extent unpredictable. PUFs can be used to pr...
Foundations of Reactive Garbling Schemes
garbling scheme foundations
font style='font-size:12px;'>
2015/12/29
Garbled circuits is a cryptographic technique, which has been used among other things for the construction
of two and three-party secure computation, private function evaluation and secure outsourcin...
On the Foundations of Physical Unclonable Functions
Physical Unclonable Functions PUF Strong t-PUFs
font style='font-size:12px;'>
2009/6/15
We investigate the foundations of Physical Unclonable Functions from several perspectives.
Firstly, we discuss formal and conceptual issues in the various current definitions of PUFs. As
we argue, t...