7,743 Hits in 7.6 sec

A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies [chapter]

Youngho Yoo, Reza Azarderakhsh, Amir Jalali, David Jao, Vladimir Soukharev
2017 Lecture Notes in Computer Science  
This scheme is an application of Unruh's construction of non-interactive zero-knowledge proofs to an interactive zero-knowledge proof proposed by De Feo, Jao, and Plût.  ...  We present the first general-purpose digital signature scheme based on supersingular elliptic curve isogenies secure against quantum adversaries in the quantum random oracle model with small key sizes.  ...  In this sense, a digital signature is basically a non-interactive zero-knowledge proof of identity, except that we need to incorporate a specific message into each proof (signature).  ... 
doi:10.1007/978-3-319-70972-7_9 fatcat:d446dpb4ifd3fh5fl2ilp5ftgi

Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives [chapter]

David Derler, Sebastian Ramacher, Daniel Slamanig
2018 Lecture Notes in Computer Science  
In this paper we address the construction of privacy-friendly cryptographic primitives for the post-quantum era and in particular accumulators with zero-knowledge membership proofs and ring signatures.  ...  Regarding efficient instantiations of our proof system, we rely on recent results for constructing efficient non-interactive zero-knowledge proofs for general circuits.  ...  We also thank Daniel Kales for ideas to reduce the cost for the conditional swap gate.  ... 
doi:10.1007/978-3-319-79063-3_20 fatcat:hyxy7lzs2nh37kjtclm2s354ce

Non-interactive Zero-knowledge for Blockchain: A Survey

Juha Partala, Tri Hong Nguyen, Susanna Pirttikangas
2020 IEEE Access  
NON-INTERACTIVE ZERO-KNOWLEDGE ARGUMENTS Zero-knowledge proofs (in the traditional sense) are interactive, online protocols.  ...  Verification is improved using special encoding for the statement. Non-interactivity is achieved with the Fiat-Shamir paradihm.  ...  Her research team Interactive Edge develops adaptive, realiable and trusted edge computing.  ... 
doi:10.1109/access.2020.3046025 fatcat:crl77kezmbfydhtvvv6i3lrzdi

A Survey of Digital Signing in the Post Quantum Era [article]

Teik Guan Tan, Jianying Zhou
2019 IACR Cryptology ePrint Archive  
Using the matrix, we identify improvements needed for all 14 applications to have a feasible post-quantum secure replacement digital signing algorithm.  ...  Besides understanding the digital signing usage, we compare the applications' signing requirements against all 6 NIST's post-quantum cryptography contest round 3 candidate algorithms.  ...  Non-interactive zero-knowledge proofs of knowledge constructions such as MPC-in-the-head [45] and ZKBoo [32] rely on multiparty computation (MPC) with collision-resistant one-way functions, which could  ... 
dblp:journals/iacr/TanZ19 fatcat:dqdej2srfnbxbeabjcu5s7wm2i

Post-Quantum VRF and its Applications in Future-Proof Blockchain System [article]

Zengpeng Li, Teik Guan Tan, Pawel Szalachowski, Vishal Sharma, Jianying Zhou
2021 arXiv   pre-print
In this paper, we propose a generic compiler to obtain the post-quantum VRF from the simple VRF solution using symmetric-key primitives (e.g., non-interactive zero-knowledge system) with an intrinsic property  ...  Our novel solution is realized via two efficient zero-knowledge systems ZKBoo and ZKB++, respectively, to validate the compiler correctness.  ...  F key is instantiated by SHA-256 that provides 128 bits of pre-image resistance against quantum adversaries. (Non-interactive) Zero-Knowledge (NIZK).  ... 
arXiv:2109.02012v1 fatcat:ssyxk5wglzcx3j5xpckoarrgmi

Efficient Set Membership Proofs using MPC-in-the-Head

Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
2022 Proceedings on Privacy Enhancing Technologies  
We integrate our technique into an open source implementation of the state-of-the-art, post quantum secure zero-knowledge protocol of Katz et al.  ...  We also show that our techniques can be used to efficiently construct post-quantum secure RingCT from only symmetric key primitives.  ...  Our implementation is generic: allowing instantiation of the non-interactive zero-knowledge proof of knowledge (NIZKPoK) with any ring and taking any algebraic circuit over said ring.  ... 
doi:10.2478/popets-2022-0047 fatcat:kjnmuvna7nh2jc2pxlgihgvekm

Post-Quantum Group Signatures from Symmetric Primitives [article]

Dan Boneh, Saba Eskandarian, Ben Fisch
2018 IACR Cryptology ePrint Archive  
Along the way we also give improvements to the zero-knowledge Merkle inclusion proofs of .  ...  While our EPID signatures for attestation are longer than standard post-quantum signatures, they are short enough for applications where the data being signed is large, such as analytics on large private  ...  Acknowledgments We would like to thank David Wu for several helpful conversations. This work is supported by NSF, the DARPA/ARL SAFEWARE project, the Simons foundation, and a grant from ONR.  ... 
dblp:journals/iacr/BonehEF18 fatcat:jdintvgxevgs5ocd6a5n6apy2a

On sigma protocols with helper for MQ and PKP, fishy signature schemes and more [article]

Ward Beullens
2019 IACR Cryptology ePrint Archive  
Our proof system can be used to improve the efficiency of applications relying on (generalizations of) Stern's protocol.  ...  We apply the Fiat-Shamir transform to obtain signature schemes with security proof in the QROM.  ...  I would also like to thank the anonymous reviewer for the suggestion to generalize PKP to signed permutations. This work was supported in part by the Research Council KU Leuven: C16/15/058.  ... 
dblp:journals/iacr/Beullens19 fatcat:b44wsexjujad5jesygd6n4z3h4

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives

Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Sebastian Ramacher, Christian Rechberger, Daniel Slamanig, Greg Zaverucha
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
A signature is a non-interactive zero-knowledge proof of x, that incorporates a message to be signed. For this proof, we leverage recent progress of Giacomelli et al.  ...  Post-Quantum Signatures. Perhaps the oldest signature scheme with post-quantum security are one-time Lamport [61] signatures, built using hash functions.  ...  Again, this has applications wider than our signature protocol as the protocol can be used for non-interactive post-quantum zero knowledge proofs secure in the QROM.  ... 
doi:10.1145/3133956.3133997 dblp:conf/ccs/ChaseDGORRSZ17 fatcat:zz67tvgotzfs7kjhwtj7kmi7ry

Preparation for Post-Quantum era: a survey about blockchain schemes from a post-quantum perspective [article]

Andrada-Teodora Ciulei, Marian-Codrin Cretu, Emil Simion
2022 IACR Cryptology ePrint Archive  
We provide an analysis of the most important cryptocurrencies according to their ranking by market capitalization (MC) in the context of quantum threats, and we end up with a review of post-quantum blockchain  ...  This paper briefly presents the most relevant algorithms and procedures that have contributed to the progress of quantum computing and the categories of post-quantum cryptosystems.  ...  . • ZK-SNARK: Zero-knowledge Succinct Non-Interactive Argument of Knowledge (ZK-SNARK) is a mechanism of proof of possession of a secret without interaction nor revealing the secret ( [207] , [54] ).  ... 
dblp:journals/iacr/CiuleiCS22 fatcat:dw3z6d6nnfc7lll55dwejilg5a

Combinatorial Digital Signature Scheme

Eliane Koussa, Jean-Charles Faugère, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret
2018 International Conference on Big Data and Cyber-Security Intelligence  
Each parameter set arises signatures of length comparable to the other signatures derived from Zero-Knowledge identification schemes.  ...  Consequently, and via the traditional Fiat-Shamir (FS) paradigm, we derive the signature scheme PKP-DSS from a Zero-Knowledge Identification Scheme (ZK-IDS) based on PKP [Sha89].  ...  Due to the call for post-quantum standards of the NIST (, there has been renewed interest in the transformed Zero-Knowledge Identification Schemes into Digital Signatures Schemes  ... 
dblp:conf/bdcsintell/KoussaFMPP18 fatcat:nushkk2vprf5vhrymdbozwt35e

Post-Quantum Secure Cryptographic Algorithms [article]

Xenia Bogomolec, Jochen Gerhard
2018 arXiv   pre-print
An overview on current developments in post quantum cryptography  ...  on SIDH amongst a LWE key exchange and a signature algorithm using symmetric-key primitives and non-interactive zero-knowledge proofs [22] .  ...  A proposal is submitted to the NIST standardization process of post-quantum signature schemes.  ... 
arXiv:1809.00371v2 fatcat:nholvlircjavza5trvkx2iqdym

Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks

Tiago M. Fernandez-Carames, Paula Fraga-Lamas
2020 IEEE Access  
Furthermore, extensive comparisons are provided on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.  ...  Blockchain and other Distributed Ledger Technologies (DLTs) have evolved significantly in the last years and their use has been suggested for numerous applications due to their ability to provide transparency  ...  There is a specific type of these proofs called Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK) that is aimed at reducing the complexity and the size of the proof [246] .  ... 
doi:10.1109/access.2020.2968985 fatcat:7wsxhxrfojdmzcxtjtrk6cmcci

Quantum solutions to possible challenges of Blockchain technology [article]

Nivedita Dey, Mrityunjay Ghosh, Amlan Chakrabarti
2021 arXiv   pre-print
With the recent advent of quantum computing, the security of current blockchain cryptosystems can be compromised to a greater extent.  ...  Post Quantum Cryptographic algorithms like Code-based, Lattice-based, Multivariate-based, and other schemes are not well suited for classical blockchain technology due to several disadvantages in practical  ...  [69] [70] Quantum threat to Ethereum Security Ethereum cryptocurrency relies on ZK-SNARK (Zero-Knowledge Succinct Non -Interactive Argument of Knowledge) technique.  ... 
arXiv:2110.05321v1 fatcat:kgrjb4bahbey7kexdx6barpfca

Non-interactive zero-knowledge proof scheme from RLWE-based key exchange

Shaofen Xie, Wang Yao, Faguo Wu, Zhiming Zheng, Hua Wang
2021 PLoS ONE  
Lattice-based non-interactive zero-knowledge proof has been widely used in one-way communication and can be effectively applied to resist quantum attacks.  ...  However, lattice-based non-interactive zero-knowledge proof schemes have long faced and paid more attention to some efficiency issues, such as proof size and verification time.  ...  With the rapid application of cryptocurrency, after Groth [20] proposed the scheme of constant-size proofs, the first zero-knowledge succinct non-interactive argument of knowledge (ZK-SNARK) based on  ... 
doi:10.1371/journal.pone.0256372 pmid:34415948 pmcid:PMC8378753 fatcat:us4jghi5avezrbx5ag4h3axe5i
« Previous Showing results 1 — 15 out of 7,743 results