441 Hits in 3.8 sec

Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme [article]

Peter B. Rønne and Arash Atashpendar and Kristian Gjøsteen and Peter Y. A. Ryan
2019 arXiv   pre-print
We show how the removal of invalid votes can be done in linear time via a solution based on recent advances in various FHE primitives such as hashing, zero-knowledge proofs of correct decryption, verifiable  ...  We present an approach for performing the tallying work in the coercion-resistant JCJ voting protocol, introduced by Juels, Catalano, and Jakobsson, in linear time using fully homomorphic encryption (FHE  ...  Acknowledgments The authors acknowledge support from the Luxembourg National Research Fund (FNR) and the Research Council of Norway for the joint project SURCVS.  ... 
arXiv:1901.02560v2 fatcat:xdaaruopwbbhrjthsfqqww5wty

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan
2012 Proceedings of the 44th symposium on Theory of Computing - STOC '12  
This extends the standard notion of fully homomorphic encryption (FHE), where users can only enlist the cloud's help in evaluating functions on their own encrypted data.  ...  In on-the-fly MPC, each user is involved only when initially uploading his (encrypted) data to the cloud, and in a final output decryption phase when outputs are revealed; the complexity of both is independent  ...  Adding Zero-Knowledge Proofs.  ... 
doi:10.1145/2213977.2214086 dblp:conf/stoc/Lopez-AltTV12 fatcat:2jw2ee3e7zahpchnpfjet366km

Functional Signcryption: Notion, Construction, and Applications [chapter]

Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay
2015 Lecture Notes in Computer Science  
obfuscation (IO) and statistically simulation-sound noninteractive zero-knowledge proof of knowledge (SSS-NIZKPoK).  ...  Finally, we exhibit a number of representative applications of FSC: (I) We develop the first construction of attribute-based signcryption (ABSC) supporting signing and decryption policies representable  ...  Statistically Simulation-Sound Non-Interactive Zero-Knowledge Proof of Knowledge Simulation-sound non-interactive zero-knowledge proof of knowledge have been introduced and formalized in the full version  ... 
doi:10.1007/978-3-319-26059-4_15 fatcat:hnjd24qtpbcvbidge3cy3i3oki

Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead [chapter]

Steven Myers, Mona Sergi, abhi shelat
2013 Lecture Notes in Computer Science  
PCP encodings [Gen09a] and generic zero-knowledge proofs [AJLA + 12, LATV11].)  ...  To illustrate the merit of this relaxed proof of knowledge property, we use our result to construct a secure multi-party computation protocol for evaluating a function f in the standard model using only  ...  Proof of Knowledge of an Encryption As noted in the Introduction, the method of Cramer, Damgård, and Nielsen [CDN01] requires an honest-verifier zero-knowledge proof of knowledge of encrypted values  ... 
doi:10.1007/978-3-642-36594-2_23 fatcat:uqboiem2ijbsff2utlxmbd74la

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam Smith
2014 Journal of Cryptology  
The technique can also be applied outside the realm of non-interactive zero-knowledge proofs, for instance to get witness-size interactive zero-knowledge proofs in the plain model without any setup or  ...  We apply this technique to both standard non-interactive zero-knowledge proofs and to universally composable non-interactive zero-knowledge proofs.  ...  Computational zero-knowledge follows from the computational zero-knowledge of (K F , P F , V F ), the pseudorandomness of G and the IND-CPA security of (K FHE , E, D, Eval).  ... 
doi:10.1007/s00145-014-9184-y fatcat:xseoys3j2jdqfpuli2f4acvvhe

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) [chapter]

Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao
2016 Lecture Notes in Computer Science  
We also build adaptively secure UC commitments and UC zero-knowledge proofs (of knowledge) from LWE.  ...  Our protocols are constructed based on a special type of cryptosystem we call equivocal FHE from LWE.  ...  For example, using our equivocal scheme we also build adaptively secure UC commitment and UC zero-knowledge proofs (of knowledge) based on hardness of LWE (see Section 4).  ... 
doi:10.1007/978-3-662-49387-8_9 fatcat:46jex2xuwzdipo2aa2y7e62whq

Secure Distributed Computation on Private Inputs [chapter]

Geoffroy Couteau, Thomas Peters, David Pointcheval
2016 Lecture Notes in Computer Science  
arithmetic circuits in terms of interaction and communication.  ...  Instantiated from multiplicatively homomorphic encryption and additively homomorphic encryption, ESPs provide a generic solution to two-party computation and lead to particularly efficient protocols for  ...  -P i proves, in zero-knowledge, that he knows plaintexts such that all the ciphertext are encryptions with pk i of those plaintexts. On the Zero-Knowledge Proof of Knowledge.  ... 
doi:10.1007/978-3-319-30303-1_2 fatcat:d6z7g7yunnakrkfqk2uxy6bxgy

A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability [chapter]

Kristian Gjøsteen, Martin Strand
2017 Lecture Notes in Computer Science  
After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway.  ...  While fully homomorphic cryptosystems are not efficient enough for the the system we sketch to be implemented and run today, we expect future improvements in fully homomorphic encryption which may eventually  ...  The main primitive we need is an efficient zero knowledge proof or argument for correct decryption.  ... 
doi:10.1007/978-3-319-70278-0_25 fatcat:ppyqeioapza3zipha6d6g2rvye

Sanitization of FHE Ciphertexts [chapter]

Léo Ducas, Damien Stehlé
2016 Lecture Notes in Computer Science  
By definition, fully homomorphic encryption (FHE) schemes support homomorphic decryption, and all known FHE constructions are bootstrapped from a Somewhat Homomorphic Encryption (SHE) scheme via this technique  ...  Additionally, when a public key is provided, ciphertexts are also re-randomizable, e.g., by adding to them fresh encryptions of 0.  ...  This strategy may effectively reduce interactivity in secure multi-party computation (MPC) protocols based on FHE, and offer amortization of an initial zero-knowledge proof on the public key.  ... 
doi:10.1007/978-3-662-49890-3_12 fatcat:wqv257smnzezdbf5f36hdywph4

Two Round Multiparty Computation via Multi-key FHE [chapter]

Pratyay Mukherjee, Daniel Wichs
2016 Lecture Notes in Computer Science  
We then extend this construction to allow for a one-round distributed decryption of a multi-key ciphertext. Our entire MPC protocol consists of the following two rounds: 1.  ...  In the honestbut-curious setting we only rely on the learning with errors (LWE) assumption, and in the fully malicious setting we additionally assume the existence of non-interactive zero knowledge arguments  ...  Constructing Threshold Multi-Key FHE We now give a high-level description of the MFHE construction and the threshold decryption protocol.  ... 
doi:10.1007/978-3-662-49896-5_26 fatcat:ylnb3mzo4bbu3douzogbugxqwu

Using Homomorphic Cryptographic Solutions on E-voting Systems

Ahmed A. Abu Aziz, Hasan N.Qunoo, Aiman A. Abu Samra
2018 International Journal of Computer Network and Information Security  
In this research, fully homomorphic encryption used to provide both operations additive and multiplication, which ease the demonstration of none interactive zero-knowledge proof NIZKP.  ...  Addition and multiplication properties of fully homomorphic encryption were used to verify the correctness of vote structure as a NIZKP, and for calculating the results of the voting process in an encrypted  ...  Zero-Knowledge Proofs Zero-knowledge proofs could be used to demonstrate the truth of a statement without revealing anything else.  ... 
doi:10.5815/ijcnis.2018.01.06 fatcat:yktqnqilljhejlrpjcbl5wxmzy

Quantum-Resistant Network for Classical Client Compatibility

Te-Yuan Lin, Chiou-Shann Fuh
2021 Information Technology and Control  
In this research, we innovatively tackled this challenge using a non-computational difficulty schemewith zero-knowledge proof in order to achieve repellency against quantum computing cryptanalysis attacks  ...  Because the time-complexity of the exhaustive keysearch for quantum computing has not reliably exceeded the reasonable expiry of crypto key validity, it is believedthat current cryptography systems built  ...  for simulating the factorization with the Shor algorithm.  ... 
doi:10.5755/j01.itc.50.2.27570 fatcat:o54oxyae75cydoiuyf6kf2esua

Four Round Secure Computation Without Setup [chapter]

Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou
2017 Lecture Notes in Computer Science  
We construct a 4-round multi-party computation protocol in the plain model for any functionality, secure against a malicious adversary.  ...  To do this, we construct an LWE based multi-key FHE scheme with a very simple one-round distributed setup procedure (vs. the trusted setup required in previous LWE based constructions).  ...  For our construction we use the 3-round, publiccoin, input-delayed witness-indistinguishable proof-of-knowledge Π WIPOK based on the work of Feige, Lapidot, Shamir [FLS99] , and the 4-round zero-knowledge  ... 
doi:10.1007/978-3-319-70500-2_22 fatcat:vesul2pae5drzbfmwihdycqca4

Design of a polynomial ring based symmetric homomorphic encryption scheme

Smaranika Dasgupta, S.K. Pal
2016 Perspectives in Science  
After certain amount of homomorphic computations, large ciphertexts are refreshed for proper decryption. The hardness of the scheme is based on the difficulty of factorizing large integers.  ...  Security of data, especially in clouds, has become immensely essential for presentday applications.  ...  Introduction Fully homomorphic encryption (FHE) schemes enable anyone to perform arbitrary homomorphic operations on the ciphertexts which can be finally decrypted to get equivalent results on the plaintexts  ... 
doi:10.1016/j.pisc.2016.06.061 fatcat:2n37rhuhebguzmiwmacnjzobg4

Predicate Encryption for Circuits from LWE [chapter]

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2015 Lecture Notes in Computer Science  
to decrypt the ciphertext individually.  ...  That is, for any polynomial function d = d(λ), we construct a predicate encryption scheme for the class of all circuits with depth bounded by d(λ), where λ is the security parameter. *  ...  On the high level, Enc * computes the FHE ciphertext honestly by sampling a secret key and using the knowledge of a.  ... 
doi:10.1007/978-3-662-48000-7_25 fatcat:sfnrzxcwkbafld3m56ib7hhihy
« Previous Showing results 1 — 15 out of 441 results