搜索结果: 1-15 共查到“密码学 verifiable”相关记录155条 . 查询时间(0.046 秒)
Verifiable Registration-Based Encryption
Public Key Encryption Registration based Encryption Key Escrow Problem
font style='font-size:12px;'>
2019/9/19
In a recent work, Garg, Hajiabadi, Mahmoody, and Rahimi (TCC 18) introduced a new encryption framework, which they referred to as Registration-Based Encryption (RBE). The central motivation behind RBE...
A publicly verifiable quantum blind signature scheme without entanglement based on asymmetric cryptography
Undeniable quantum signature scheme Impersonation attack Quantum asymmetric cryptography
font style='font-size:12px;'>
2019/7/15
In recent years, several cryptographic scholars have proposed quantum blind signature schemes. However, their methods require the signatories and the inspectors to share common keys in advance, which ...
2-Message Publicly Verifiable WI from (Subexponential) LWE
LWE NP
font style='font-size:12px;'>
2019/7/15
We construct a 2-message publicly verifiable witness indistinguishable argument system for NP assuming that the Learning with Errors (LWE) problem is subexponentially hard. Moreover, the protocol is `...
Athena: A verifiable, coercion-resistant voting system with linear complexity
cryptographic protocols election schemes
font style='font-size:12px;'>
2019/7/8
Seminal work by Juels, Catalano & Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This manuscript attempts to advance the state-of-the-art by delivering a...
Verifiable Computing for Approximate Computation
verifiable computing interactive proofs approximate arithmetic
font style='font-size:12px;'>
2019/7/8
Verifiable computing (VC) is a complexity-theoretic method to secure the integrity of computations. The need is increasing as more computations are outsourced to untrusted parties, e.g., cloud platfor...
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Verifiable Delay Functions Random Oracle Model
font style='font-size:12px;'>
2019/6/6
Boneh, Bonneau, B{\"u}nz, and Fisch (CRYPTO 2018) recently introduced the notion of a \emph{verifiable delay function} (VDF). VDFs are functions that take a long \emph{sequential} time TT to compute, ...
Tight Verifiable Delay Functions
foundations Verifiable Delay Functions
font style='font-size:12px;'>
2019/6/5
A Verifiable Delay Function (VDF) is a function that takes at least TT sequential steps to evaluate and produces a unique output that can be verified efficiently, in time essentially independent of TT...
Continuous Verifiable Delay Functions
Verifiable delay functions continuous verifiability randomness beacons
font style='font-size:12px;'>
2019/6/4
We introduce the notion of a continuous verifiable delay functioncontinuous verifiable delay function (cVDF): a function gg which is (a) iteratively sequential---meaning that evaluating the iteration ...
Formal Notions of Security for Verifiable Homomorphic Encryption
Verifiable homomorphic encryption Formal notions of security Non-malleability
font style='font-size:12px;'>
2019/5/31
Homomorphic encryption enables computations with encrypted data, however, in its plain form, it does not guarantee that the computation has been performed honestly. For the Fully Homomorphic Encryptio...
Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
Quantum cryptography Delegation of quantum computation Self-testing
font style='font-size:12px;'>
2019/3/2
The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a q...
Non-interactive Cryptographic Timestamping based on Verifiable Delay Functions
non-interactive cryptographic timestamping universal composability verifiable delay functions
font style='font-size:12px;'>
2019/3/1
We present the first treatment of non-interactive publicly-verifiable timestamping schemes in the Universal Composability framework. Similar to a simple construction by Mahmoody et al., we use non-par...
A note on isogeny-based hybrid verifiable delay functions
verifiable delay function time-lock puzzle isogeny-based cryptography
font style='font-size:12px;'>
2019/3/1
Using the idea behind the recently proposed isogeny- and paring-based verifiable delay function (VDF) by De Feo, Masson, Petit and Sanso, we construct an isogeny-based VDF without the use of pairings....
Verifiable Delay Functions from Supersingular Isogenies and Pairings
Verifiable Delay Function Isogenies Pairings
font style='font-size:12px;'>
2019/2/25
We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic curve cryptography. We discuss both the advantages and some drawbacks of our constructions, we study their securi...
Publicly Verifiable Proofs from Blockchains
Non-interactive Witness Indistinguishability Blockchain public verifiability NIZK
font style='font-size:12px;'>
2019/1/26
A proof system is publicly verifiable, if anyone, by looking at the transcript of the proof, can be convinced that the corresponding theorem is true. Public verifiability is important in many applicat...
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs
public-key cryptography verifiable random functions
font style='font-size:12px;'>
2019/1/18
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed ...