A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Mutual Data Authentication Using Manually Authenticated Strings
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
We show that non-malleability of the commitment scheme is essential for the security of the SAS and the MA-3 schemes and that extractability or equivocability do not imply non-malleability. ...
In this paper we analyse the SAS protocol by Vaudenay and propose a new three round protocol MA-3 for mutual data authentication based on a cryptographic commitment scheme and short manually authenticated ...
Although latter seems paradoxical, since historically non-malleable commitments were constructed from equivocable ones [CIO98] , there is no contradiction, as authors use equivocable commitments in a ...
doi:10.1007/11935070_6
fatcat:nezvevj43zbrdocm75pxlvulw4
On Simulation-Sound Trapdoor Commitments
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
non-malleable. ...
Finally, we explore the relation between SSTC schemes and non-malleable commitment schemes by presenting a sequence of implication and separation results, which in particular imply that SSTC schemes are ...
To relate our results to reusable non-malleable commitment schemes as de ned in 17], we need to consider adversaries that input a vector of commitments (and later decommitments), and output a vector of ...
doi:10.1007/978-3-540-24676-3_23
fatcat:eqn424j2brhsfg7lgyakqtl6mi
Very-Efficient Simulatable Flipping of Many Coins into a Well
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is well known that this functionality can be securely achieved in the ideal/real simulation paradigm, using commitment schemes that are simultaneously extractable (X) and equivocable (Q). ...
Besides the base X and Q commitments, the new commitment scheme only requires corresponding collision-resistant hashing, pseudo-random generation and application of a threshold erasure code. ...
via non-local rewinding). ...
doi:10.1007/978-3-662-49387-8_12
fatcat:2nvbbmnk3bemtbwkp4sikvgxr4
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our result is analogous to the unified framework of Lin, Pass, and Venkitasubramaniam [STOC'09, Asiacrypt'12] that, however, only yields non-black-box constructions of UC protocols. ...
Our unified framework shows that to obtain black-box constructions of UC protocols, it suffices to implement a special purpose commitment scheme that is, in particular, concurrently extractable using a ...
Concurrent Non-malleable Commitments in T -Model Next we define the concurrent non-malleability of a commitment scheme. ...
doi:10.1007/978-3-319-70500-2_26
fatcat:bytospaqiff4bmrujryrb66qry
Practical UC security with a Global Random Oracle
2014
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Starting from the work of Lindell and Pinkas [LP07], who constructed efficient two-party computation protocols based on Yao's garbled circuit [Yao86] via a novel cut-and-choose technique, a prolific sequence ...
UC commitments in the gRO model. ...
Due to the unpredictability of the RO, adding this prefix ensures non-malleability. Protocol 2.Non-interactive proof of knowledge NIWIpok [Pas03] . ...
doi:10.1145/2660267.2660374
dblp:conf/ccs/Canetti0S14
fatcat:zlix3j3o6ncg3pynvygouwxbwm
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our construction also makes use of a recent advance on nonmalleability: a delayed-input 4-round non-malleable zero knowledge argument. ...
Indeed, in parallel with the 3-round 3-robust non-malleable commitment a WIPoK is executed in KOOT. ...
Delayed-Input Non-Malleable Zero Knowledge Here we follow [COSV17a] . ...
doi:10.1007/978-3-319-70500-2_23
fatcat:2n6n5yx3vrbb5eja3jyfrsghoi
Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake
2019
2019 IEEE Symposium on Security and Privacy (SP)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
), and equivocal commitments. ...
Finally, our construction will make use of non-interactive equivocal commitments and pseudorandom functions (PRFs). ...
keys, with a non-negligible advantage. ...
doi:10.1109/sp.2019.00063
dblp:conf/sp/KerberKKZ19
fatcat:abtqsxa3e5asbdh75nswaepybm
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
in the underlying commitment. ...
For this construction, we require the so-called one-many commit-and-prove primitive introduced in the original work of Canetti, Lindell, Ostrovsky and Sahai in STOC 2002 that is round-efficient and black-box ...
As such, introducing transferrability naturally requires protocols to address the issue of non-malleability. ...
doi:10.1007/978-3-662-53641-4_15
fatcat:h3ouxxc4wzetpgfiw7alytfhve
On the Power of Secure Two-Party Computation
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Core to this construction is a new way of transforming 2PC protocols to efficient (adaptively secure) instance-dependent commitment schemes. ...
MPC-in-the-head" technique that has found numerous applications in obtaining "blackbox" approaches, such as unconditional two-party computation [IPS08] , secure computation of arithmetic circuits [IPS09] , non-malleable ...
Adaptive ZK via "2PC-in-the-head". ...
doi:10.1007/978-3-662-53008-5_14
fatcat:o2gtgbyqfncfppt67cveqoe3ua
GUC-Secure Join Operator in Distributed Relational Database
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
For this goal we introduce a notion of identity-augmented non-malleable zero-knowledge proofs of knowledge which may be of independent values. ...
As a result, P gets X 's entries {(w ,x ),(w ,x )} and can now get the result of Join(w:X ,X ), i.e., {(w ,x ,y ),(w ,x ,y )}, by a local join computation. ...
[8, 14] developed an efficient method to derive non-malleable zero-knowledge proof protocols based-on simulation-sound tag-based commitment schemes and the so-called Ω-protocols (proposed in [14] ) ...
doi:10.1007/978-3-642-11145-7_29
fatcat:yotdeferozd3jpgqbnj3z4lxa4
Black-box non-black-box zero knowledge
2014
Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We show how to commit to a string of arbitrary size and to prove statements over the bits of the string. ...
Both the commitment and the proof are succinct, hide the input size and use standard primitives in a black-box way. ...
Black-box, round-efficient secure computation via non-malleability am-
plification. In FOCS, pages 531-540. IEEE Computer Society, 2010.
[Xia11]
David Xiao. ...
doi:10.1145/2591796.2591879
dblp:conf/stoc/GoyalOSV14
fatcat:2cn4htdd4req3lfcc5jumdhphy
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
which the extractor is also an ϵ-simulator; - ϵ-zero-knowledge commit-and-prove whose commit stage is extractable with ϵ-simulation; - ϵ-simulatable coin-flipping; - ϵ-zero-knowledge arguments of knowledge ...
A recent work by Chia, Chung, Liu, and Yamakawa (FOCS'21) shows that post-quantum 2PC with standard simulation-based security is impossible in constant rounds, unless either 𝐍𝐏⊆𝐁𝐐𝐏 or relying on non-black-box ...
Acknowledgments We thank Susumu Kiyoshima for answering questions regarding the strongly extractable commitment in [Kiy14]. ...
arXiv:2111.08665v2
fatcat:vwuubopj3rh65n2k3d3oqpar5i
P4TC—Provably-Secure yet Practical Privacy-Preserving Toll Collection
2020
Proceedings on Privacy Enhancing Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The DR only considers the latter version as this is protected by the non-malleability of the CCA encryption. ...
Cryptographic Building Blocks: Our construction makes use of non-interactive zero-knowledge (NIZK) proofs, equivocal and extractable homomorphic commitments, digital signatures, public-key encryption, ...
Instead, S 6 injects suitable commitments to vectors of zeros. This equals the behavior of the final simulator S user-sec π P4TC . ...
doi:10.2478/popets-2020-0046
fatcat:a5cxdztdffguvm7a3wn6snyqwe
From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
distillation for achieving information-theoretic deniability, followed by an analysis of other closely related results such as the relation between the impossibility of unconditionally secure quantum bit commitment ...
Mayers' equivocation transformation relies on the fact that the global state is pure, hence a Schmidt decomposition exists allowing Alice to perform local operations to change the bit she committed to. ...
These ensure non-malleability of ballots, also across elections by including in the hash of the Fiat-Shamir heuristic. Tallying. ...
arXiv:2003.11663v1
fatcat:7ul4q6mupjcyzfyspus6xwh2ai
New Frameworks for Concurrently Composable Multi-Party Computation
2019
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In [Cia+16] it is shown that the non-malleable commitment scheme from a preliminary version of [GPR16] is not concurrent non-malleable. ...
If there exists a statistically binding, parallel non-malleable commitment scheme, then there also exists a statistically binding and parallel non-malleable commitment scheme that is not concurrent nonmalleable ...
For instance, perfectly binding commitment schemes cannot be constructed in our framework ...
doi:10.5445/ir/1000091915
fatcat:xiur74bjcnce7gl5vgflwj4tga
« Previous
Showing results 1 — 15 out of 213 results