搜索结果: 1-12 共查到“军事学 Constant Rounds”相关记录12条 . 查询时间(0.101 秒)
Efficient and Constant-Rounds Secure Comparison through Dynamic Groups and Asymmetric Computations
cryptographic protocols secure comparison
2018/3/6
Within recent years, secure comparison protocols have been proposed using binary decomposition and properties of algebraic fields. These have been repeatedly optimized and increased in efficiency, but...
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
zero knowledge resettable ZK resettable soundness
2017/9/25
In FOCS 2001 Barak et al. conjectured the existence of zero-knowledge arguments that remain secure against resetting provers and resetting verifiers. The conjecture was proven true by Deng et al. in F...
Secure Multiparty RAM Computation in Constant Rounds
Secure computation RAM computation Garbled RAM
2016/12/10
Securing computation of a random access machine (RAM) program typically entails that it be first converted into a circuit. This conversion is unimaginable in the context of big-data applications where...
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
Constant Rounds Guaranteed Complexity
2016/1/7
The traditional setting for concurrent zero knowledge considers a server that proves a statement in
zero-knowledge to multiple clients in multiple concurrent sessions, where the server’s actions in a...
Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds
cryptographic protocols adaptive security
2016/1/6
Cryptographic protocols with adaptive security ensure that security holds against an adversary
who can dynamically determine which parties to corrupt as the protocol progresses—or
even after the pro...
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
Secure Computation / Multi-party Computation Constant-Rounds Linear Exponentiation Modulo Reduction Bit-Decomposition
2012/3/29
Bit-decomposition is an important primitive in multi-party computation (MPC). Given a sharing of secret $x$, it allows the parties to compute the sharings of the bits of $x$ in constant rounds. With t...
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line of works was initiated...
Concurrently Secure Computation in Constant Rounds
foundations / secure multi-party computation protocol composition universal composability super-polynomial simulation
2012/3/28
We study the problem of constructing concurrently secure computation protocols in the plain model, where no trust is required in any party or setup. While the well established UC framework for concurr...
Concurrently Secure Computation in Constant Rounds
foundations secure multi-party computation protocol composition universal composability super-polynomial simulation
2011/6/9
We study the problem of constructing concurrently secure computation protocols in the plain model, where no trust is required in any party or setup. While the well established UC framework for concurr...
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction
Multi-party Computation Constant-Rounds Linear Exponentiation Modulo Reduction Bit-Decomposition
2011/2/23
In a recent work, Ning and Xu proposed a generalization of bit-decomposition which can, given a sharing of secret $a$ and an integer $m \ge 2$, compute the sharings (or bitwise sharings) of the base-$...
Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Zero-Knowledge Precise Zero-Knowledge Concurrent Zero-Knowledge
2009/9/27
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in
Eurocrypt'08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in
STOC'06). This not...
Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Zero-Knowledge Precise Zero-Knowledge Concurrent Zero-Knowledge Interactive Proofs and Arguments
2009/9/22
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in
Eurocrypt'08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in
STOC'06). This not...