Filters








7,797 Hits in 3.6 sec

Improved Non-Committing Encryption Schemes based on a General Complexity Assumption

Ivan B. Damgård, Jesper Buus Nielsen
2000 BRICS Report Series  
This offers a considerable efficiency<br />improvement over the first non-committing encryption scheme proposed by<br />Canetti et al.  ...  Finally, at some loss of efficiency, our scheme can be based on general collections of trapdoor one-way permutations without the simulatability assumption, and without the common domain assumption of Canetti  ...  assumption sufficient for non-committing encryption.  ... 
doi:10.7146/brics.v7i6.20134 fatcat:ygsdwdsjhfdbxkhdde7vamymvq

Improved Non-committing Encryption Schemes Based on a General Complexity Assumption [chapter]

Ivan Damgård, Jesper Buus Nielsen
2000 Lecture Notes in Computer Science  
This offers a considerable efficiency improvement over the first non-committing encryption scheme proposed by Canetti et al.  ...  Finally, at some loss of efficiency, our scheme can be based on general collections of trapdoor one-way permutations without the simulatability assumption, and without the common domain assumption of Canetti  ...  assumption sufficient for non-committing encryption.  ... 
doi:10.1007/3-540-44598-6_27 fatcat:sehuadtltvdafd7d3g4pt4sjy4

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols [chapter]

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
2009 Lecture Notes in Computer Science  
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al.  ...  Our encryption scheme is a 2-round protocol, matching the round complexity of Canetti et al. and improving upon that in Damgård and Nielsen. -Weaker assumptions.  ...  If we allow for an interactive key generation phase, Damgård and Nielsen [DN00] , building on [B97, CFGN96] , constructed 3-round non-committing encryption schemes based on a more general assumption,  ... 
doi:10.1007/978-3-642-10366-7_17 fatcat:pte5no75lre7fggv6wnowbncvu

Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security [chapter]

Marc Fischlin, Benoît Libert, Mark Manulis
2011 Lecture Notes in Computer Science  
Our schemes are also adaptively secure assuming reliable erasures.  ...  We present the first provably secure constructions of universally composable (UC) commitments (in pairing-friendly groups) that simultaneously combine the key properties of being non-interactive, supporting  ...  Cramer-Shoup Encryption Based on DLIN Assumption This section recalls a variant of the Cramer-Shoup encryption scheme [11] based on the DLIN assumption and suggested in [28, 17] .  ... 
doi:10.1007/978-3-642-25385-0_25 fatcat:x5amq5zz5vgbbhai7rwsxx4zaq

Page 6313 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
Hwang (Ottawa, ON) 2002h:94049 94A60 Damgard, Ivan (DK-ARHS-BR; Aarhus); Nielsen, Jesper Buus (DK-ARHS-BR; Aarhus) Improved non-committing encryption schemes based on a general complexity assumption.  ...  This offers a considerable efficiency improvement over the first non-committing encryption scheme proposed by R. Canetti et al.  ... 

Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems [chapter]

Cynthia Dwork, Moni Naor, Guy N. Rothblum
2016 Lecture Notes in Computer Science  
This is the first non trivial twomessage succinct argument system that is based on a standard polynomial-time hardness assumption.  ...  On the other hand, we prove that under standard assumptions there is a sound interactive proof protocol that, when run through the compiler, results in a protocol that is not sound.  ...  Acknowledgments We thank Pavel Hubáček and Ilan Komargodski for helpful comments on the paper.  ... 
doi:10.1007/978-3-662-53015-3_5 fatcat:tnbty3cfvfhljo4dl3g3gpvs7a

Public-Key Cryptography (Dagstuhl Seminar 16371)

Marc Fischlin, Alexander May, David Pointcheval, Tal Rabin, Marc Herbstritt
2017 Dagstuhl Reports  
Second, the technique allows to rule out tight reductions from a very general class of non-interactive complexity assumptions.  ...  This improvement naturally extends to generalized commitments and more complex proofs without modifying the original protocols.  ... 
doi:10.4230/dagrep.6.9.46 dblp:journals/dagstuhl-reports/Fischlin0PR16 fatcat:figv27hq4feibl5nzb7snrtm2i

Non-committing Encryption from Φ-hiding [chapter]

Brett Hemenway, Rafail Ostrovsky, Alon Rosen
2015 Lecture Notes in Computer Science  
The second message consists of a ciphertext of size O(n log n + λ). The security of our scheme is proved based on the Φ-hiding problem.  ...  In this work, we present the first non-committing encryption scheme that achieves ciphertext expansion that is logarithmic in the message length.  ...  All prior constructions of non-committing encryption are loosely based on the following paradigm.  ... 
doi:10.1007/978-3-662-46494-6_24 fatcat:nkfuoe3evrdbbpnedkfygf6xn4

Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits [chapter]

Nir Bitansky, Alessandro Chiesa
2012 Lecture Notes in Computer Science  
The scheme is based on fully-homomorphic encryption (and no additional assumptions are needed for our succinct argument). (3) In addition, we revisit the problem of non-interactive succinct arguments of  ...  As a main tool for this transformation, we construct a succinct multi-function commitment that (a) allows the sender to commit to a vector of functions in time and space complexity that are essentially  ...  We also thank Ran Canetti, Omer Paneth, and Ben Riva for valuable discussions on MIP-based SNARKs.  ... 
doi:10.1007/978-3-642-32009-5_16 fatcat:je4zuvn23bcfvb5xwzgv3t3zjm

Homomorphic Encryption — Theory and Application [chapter]

Jaydip Sen
2013 Theory and Practice of Cryptography and Network Security Protocols and Technologies  
Improving their construction as well as the underlying complexity assumptions is an important open problem (Vaikuntanathan, 2011) .  ...  However, the hardness assumption of the security of the scheme is stronger than that of Gentry's scheme (Gentry, 2009) . The improved complexity of the proposed scheme stems from two sources.  ... 
doi:10.5772/56687 fatcat:amgaohpdbnal3ly6nsx4nvasmm

Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? [chapter]

Ronald Cramer, Ivan Damgård
1998 Lecture Notes in Computer Science  
We present a general method for constructing commitment schemes based on existence of q-one way group homomorphisms, in which elements in a nite prime eld GF(q) can be committed to.  ...  Particular assumptions su cient for our commitment schemes include: the RSA assumption, hardness of discrete log in a prime order group, and polynomial security of Di e-Hellman encryption.  ...  Acknowledgement We thank the anonymous referees for comments that substantially improved our presentation.  ... 
doi:10.1007/bfb0055745 fatcat:2m5cagx75ffyza6ekrrhvt4kpu

Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption [chapter]

Yehuda Lindell
2011 Lecture Notes in Computer Science  
Our commitment stage is non-interactive, has a common reference string with O(1) group elements, and has complexity of O(1) exponentiations for committing to a group element (to be more exact, the effective  ...  Commitment schemes are a basic building block in many cryptographic constructions, and as such universally composable commitments are of great importance in constructing UC-secure protocols.  ...  We also thank them for the generous way that they dealt with this.  ... 
doi:10.1007/978-3-642-20465-4_25 fatcat:5wmhkuxmf5fbrl5fgkntjsr4ku

A Novel Approach For Verifiable Secret Sharing In Proactive Network Using Rsa

Vikas Kumar, Prof. O.P. Verma, Deepak Kumar, Sandeep Jain
2017 Zenodo  
The solution is based on a three-round solution of so-called weak verifiable secret sharing (WSS), for which we also prove that three rounds are a lower bound.  ...  The round complexity of a VSS protocol is defined as the number of rounds performed in the sharing phase.  ...  We present new VSS schemes based only on the definitional properties of commitments that are almost as good as existing VSS schemes based homomorphic commitments.  ... 
doi:10.5281/zenodo.581480 fatcat:fxelltio7zgtvfprmque3skvka

A Review of Cryptographic Electronic Voting

Yun-Xing Kho, Swee-Huay Heng, Ji-Jian Chin
2022 Symmetry  
A vast number of e-voting schemes including mix-net-based e-voting, homomorphic e-voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting, and hybrid e-voting have been  ...  Subsequently, some potential research directions are suggested based on our observations.  ...  The security of schemes based on computational complexity/classical assumptions is not secure in terms of quantum attacks owing to the advancement of quantum computers on the horizon [150] .  ... 
doi:10.3390/sym14050858 fatcat:6dzkgrpxgfaanfaxwu3t7teco4

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures [chapter]

Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven
2014 Lecture Notes in Computer Science  
We then show how our new protocol can be combined with a proof of knowledge for Pedersen commitments in order to prove that the committed value is the same as the encrypted one.  ...  Finally, we make use of this to construct a new group signature scheme that is a "hybrid" in the sense that privacy holds under a lattice-based assumption while security is discrete-logarithm-based.  ...  We do not make any assumptions on the auxiliary commitment scheme.  ... 
doi:10.1007/978-3-662-45611-8_29 fatcat:pxvk6mwpp5c57dzsf6opwljfda
« Previous Showing results 1 — 15 out of 7,797 results