搜索结果: 1-15 共查到“军事学 interactive”相关记录134条 . 查询时间(0.178 秒)
Randomly Rotate Qubits Compute and Reverse --- IT-Secure Non-Interactive Fully-Compact Homomorphic Quantum Computations over Classical Data Using Random Bases
Homomorphic encryption Quantum cryptography Information-theoretic security
font style='font-size:12px;'>
2019/9/16
Homomorphic encryption (HE) schemes enable processing of encrypted data and may be used by a user to outsource storage and computations to an untrusted server. A plethora of HE schemes has been sugges...
Non-Interactive Zero Knowledge Proofs in the Random Oracle Model
FS transform NIZK random oracle model
font style='font-size:12px;'>
2019/8/22
The Fiat-Shamir (FS) transform is a well known and widely used technique to convert any constant-round public-coin honest-verifier zero-knowledge (HVZK) proof or argument system CIPC=(Prov,Ver)CIPC=(P...
Decentralized Multi-authority Anonymous Authentication for Global Identities with Non-interactive Proofs
anonymous authentication attribute collusion attack
font style='font-size:12px;'>
2019/6/14
We propose a decentralized multi-authority anonymous authentication scheme in which a prover and a verifier are non-interactive. We give two security definitions; resistance against collusion attacks ...
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments
NIZK USS-NIZK black-box construction
font style='font-size:12px;'>
2019/6/13
Highly efficient non-interactive zero-knowledge arguments (NIZK) are often constructed for limited languages and it is not known how to extend them to cover wider classes of languages in general. In t...
Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge
NIZK Security Amplification
font style='font-size:12px;'>
2019/6/4
We develop novel techniques to leverage the use of leakage simulation lemma (Jetchev-Peitzrak TCC 2014) to argue amplification. A crucial component of our result is a new notion for secret sharing NPN...
DLSAG: Non-Interactive Refund Transactions For Interoperable Payment Channels in Monero
Linkable Ring Signature Payment Channel Blockchain
font style='font-size:12px;'>
2019/6/3
Monero has emerged as one of the leading cryptocurrencies with privacy by design. However, this comes at the price of reduced expressiveness and interoperability as well as severe scalability issues. ...
Non-Interactive MPC with Trusted Hardware Secure Against Residual Function Attacks
Non-Interactive MPC Communication round complexity Trusted hardware
font style='font-size:12px;'>
2019/5/9
Secure multiparty computation (MPC) has been repeatedly optimized, and protocols with two communication rounds and strong security guarantees have been achieved. While progress has been made construct...
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
parallel repetition interactive argument smooth KL-divergence
font style='font-size:12px;'>
2019/4/22
Soundness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of...
Theory and application of computationally independent one-way functions: Interactive proof of ability - Revisited
one-way functions zero knowledge proof computational independence
font style='font-size:12px;'>
2019/4/1
We introduce the concept of computationally independent pair of one-way functions (CI-OWF). We also provide two rich classes of examples of such functions based on standard assumptions. We revisit two...
A Note on Key Agreement and Non-Interactive Commitments
Non-interactive commitments key agreement
font style='font-size:12px;'>
2019/3/13
We observe that any key agreement protocol satisfying perfect completeness, regardless of its round complexity, can be used to construct a non-interactive commitment scheme.
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...
Non-Interactive Keyed-Verification Anonymous Credentials
Anonymous credentials keyed-verification anonymous credentials non-interactive anonymous credentials
font style='font-size:12px;'>
2019/2/27
Anonymous credential (AC) schemes are protocols which allow for authentication of authorized users without compromising their privacy. Of particular interest are non-interactive anonymous credential (...
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup
public-key cryptography zero knowledge
font style='font-size:12px;'>
2019/1/26
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge aros...
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE
NIZK LWE
font style='font-size:12px;'>
2019/1/4
We construct non-interactive zero-knowledge (NIZK) arguments for NPNP from any circular-secure fully homomorphic encryption (FHE) scheme. In particular, we obtain such NIZKs under a circular-secure va...
Fully Bideniable Interactive Encryption
cryptographic protocols deniable encryption
font style='font-size:12px;'>
2019/1/2
While standard encryption guarantees secrecy of the encrypted plaintext only against an attacker that has no knowledge of the communicating parties’ keys and randomness of encryption, deniable encrypt...