搜索结果: 1-14 共查到“军事学 simultaneous”相关记录14条 . 查询时间(0.029 秒)
Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge
NIZK Security Amplification
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...
The Communication Complexity of Private Simultaneous Messages, Revisited
Secure Computation Information Theoretic Security
2018/2/9
We also get a similar lower-bound for a function that can be computed by a polynomial-size circuit (or even polynomial-time Turing machine under standard complexity-theoretic assumptions). This yields...
Simultaneous Secrecy and Reliability Amplification for a General Channel Model
channel secrecy reliability
2016/12/10
We present a general notion of channel for cryptographic purposes, which can model either a (classical) physical channel or the consequences of a cryptographic protocol, or any hybrid. We consider {\e...
Server-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model
two-party computation simultaneous corruption universal composability with local adversaries
2016/1/6
We consider secure two-party computation in the client-server model. In our scenario, two adversaries
operate separately but simultaneously, each of them corrupting one of the parties and a
restrict...
Finding Small Solutions of a Class of Simultaneous Modular Equations and Applications to Modular Inversion Hidden Number Problem and Inversive Congruential Generator
Modular Inversion Hidden Number Problem Inversive Congruential Generator
2016/1/6
In this paper we revisit the modular inversion hidden number
problem and the inversive congruential pseudo random number generator
and consider how to more efficiently attack them in terms of fewer
...
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
information-theoretic security Private Simultaneous Messages Zero-Information Arthur-Merlin
2015/12/21
G¨o¨os, Pitassi and Watson (ITCS, 2015) have recently introduced the notion of Zero-Information
Arthur-Merlin Protocols (ZAM). In this model, which can be viewed as a private version of the
standard...
Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves
Provable data possession proofs of retrievability
2014/3/12
When outsourcing large sets of data to the cloud, it is desirable for clients to efficiently check, whether all outsourced data is still retrievable at any later point in time without requiring to dow...
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction
cryptographic protocols secure computation
2014/3/13
Halevi, Lindell, and Pinkas (CRYPTO 2011) recently proposed a model for secure computation that captures communication patterns that arise in many practical settings, such as secure computation on the...
Simultaneous Resettable WI from One-way Functions
foundations / resettable security witness indistinguishability
2013/2/21
In this short note, we demonstrate that the existence of one-way functions implies the existence of an $\omega(1)$-round simultaneously resettable witness indistinguishable argument.
Secure Computation on the Web: Computing without Simultaneous Interaction
cryptographic protocols / SFE Web-based computing
2012/3/29
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even if some of the partici...
Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design
foundations Simultaneous Approximation Problem Analytic Number Theory Diophantine Approximation Provable Security Commitment Scheme
2010/7/13
Since the introduction of the concept of provable security, there has been the steady search for suitable problems that can be used as a foundation for cryptographic schemes. Indeed, identifying such ...
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Simultaneous Resettability Conjecture New Non-Black-Box Simulation Strategy resettable zero-knowledge proofs
2009/6/11
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of
resettable zero-knowledge proofs, where the protocol must be zero-knowledge even if
a cheating verifier can reset the ...
Simultaneous field divisions: an extension of Montgomery's trick
Simultaneous divisions Montgomery's trick Simultaneous inversion
2009/6/4
Simultaneous field divisions: an extension of Montgomery's trick.
New Notions of Soundness and Simultaneous Resettability in the Public-Key Model
rZK arguments PRF
2009/4/16
In this paper, some new notions of soundness in public-key model are presented. We clarify the relationships among our new notions of soundness and the original 4 soundness notions presented by Micali...