Filters








562 Hits in 3.2 sec

Hash Proof Systems over Lattices Revisited [chapter]

Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach
2018 Lecture Notes in Computer Science  
Hash Proof Systems or Smooth Projective Hash Functions (SPHFs) are a form of implicit arguments introduced by Cramer and Shoup at Eurocrypt'02.  ...  We provide general theorems to ease the proofs of correctness and security (a.k.a., smoothness or universality) of SPHFs over standard lattice-based encryption schemes.  ...  It can send this projected hash value to the verifier which will accept the proof, if pH matches its hash value H.  ... 
doi:10.1007/978-3-319-76581-5_22 fatcat:eocaidwaunhr5ch5avb6jtyjzi

Hash Proof System Based on Lattice

Feng Xia, Bo Yang, Qiong Huang, Sha Ma
2012 International Journal of Advancements in Computing Technology  
We present a hash proof systems (HPS)based on hard lattice problems including learning with error (LWE) and inhomogeneous small integer solution (ISIS).  ...  lattice problem.  ...  hash proof system.  ... 
doi:10.4156/ijact.vol4.issue8.1 fatcat:44gkrtfkvzcgngtjtbkk2jtmsm

Revisiting TESLA in the Quantum Random Oracle Model [chapter]

Erdem Alkim, Nina Bindel, Johannes Buchmann, Özgür Dagdelen, Edward Eaton, Gus Gutoski, Juliane Krämer, Filip Pawlega
2017 Lecture Notes in Computer Science  
Moreover, a variant using chameleon hash functions was lifted to the quantum random oracle model (QROM).  ...  Continuing inductively, we see that the state of D's system at the end of an interaction with simulated oracles is q s δ-close to a probailistic mixture over hash oracles of states of D's system at the  ...  B.7 The Distinguisher's State, Revisited Recall from Section B.2 the state ρ H , which is the state of D's system immediately prior to the sign query in the first block.  ... 
doi:10.1007/978-3-319-59879-6_9 fatcat:qd3gs6qknban5jbkq2fq45fz6i

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
To our knowledge, the first generation of blockchain systems used inherently inefficient proof-of-work consensuses, and the research community tried to achieve the same properties by proposing proof-of-stake  ...  Our novel solution is realized via two efficient zero-knowledge systems ZKBoo and ZKB++, respectively, to validate the compiler correctness.  ...  [11] also provide a practical instantiation of a signature scheme, Dilithium-QROM, with a tight security reduction in the QROM from the Module-LWE assumption over the lattice.  ... 
arXiv:2109.02012v1 fatcat:ssyxk5wglzcx3j5xpckoarrgmi

Page 2646 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Vardi, Weak alternating automata and tree automata emptiness (224-233); Denis Thérien and Thomas Wilke, Over words, two variables are  ...  196-202); Richard Beigel, Harry Buhrman and Lance Fortnow, NP might not be as easy as detecting unique solutions (203-208); Ran Canetti, Oded Goldreich and Shai Halevi, The random ora- cle methodology, revisited  ... 

CCA2-secure Lattice-based Public Key Encryption with Equality Test in Standard Model [article]

Dung Hoang Duong, Partha Sarathi Roy, Willy Susilo, Kazuhide Fukushima, Shinsaku Kiyomoto, Arnaud Sipasseuth
2021 arXiv   pre-print
In addition, we present a modification of the scheme by Duong et al. over integer lattices to attain the CCA2-security.  ...  At ACISP 2019, Duong et al. proposed a direct construction of PKEET over integer lattices in the standard model. However, their scheme does not reach the CCA2-security.  ...  We next revisit and modify the PKEET construction over integer lattices by Duong et al. [11] to achieve CCA2-security by correctly applying the CHK transformation.  ... 
arXiv:2005.03178v4 fatcat:2quojqnkpvhbnht5h2sku5uezy

Page 3653 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
The main technical contribution is showing that if a language L has an Arthur-Merlin (i.e. public coin) honest-verifier statistical SZK proof system then L has an (any-verifier) SZK proof system when we  ...  In this paper, we present a novel use of lattice reduction, which is of independent interest, exploiting in a systematic manner the notion of an orthogonal lattice.  ... 

Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP

Artur Mariano, Christian Bischof, Thijs Laarhoven
2015 2015 44th International Conference on Parallel Processing  
In this paper, we assess the practicability of HashSieve, a recently proposed sieving algorithm for the Shortest Vector Problem (SVP) on lattices, on multi-core shared memory systems.  ...  With our implementation, we were able to solve the SVP on an arbitrary lattice in dimension 96, in less than 17.5 hours, using 16 physical cores.  ...  According to our model, executing a lattice in dimension 100 with optimal parameters would require over 2.5 TB of RAM.  ... 
doi:10.1109/icpp.2015.68 dblp:conf/icpp/MarianoBL15 fatcat:ephcmyrqbrccrjeq7px3ingc7y

Lattice-based strongly-unforgeable forward-secure identity-based signature scheme with flexible key update

2017 KSII Transactions on Internet and Information Systems  
In this paper, we first revisit the framework of forward-secure identity-based signatures, and aim at supporting flexible key update at multi time period.  ...  Then we propose a post-quantum forward-secure identity-based signature scheme from lattices and use the basis delegation technique to provide flexible key update.  ...  s forward-secure identity-based signature scheme over lattices and its security proof are reviewed and analyzed.  ... 
doi:10.3837/tiis.2017.05.027 fatcat:n7rljmz2fjgivhpxzob2iqvqqa

Symmetric Cryptography [chapter]

2006 Security in Fixed and Wireless Networks  
Digital signature algorithms (in combination with hash functions) replace hand-written signatures in electronic transactions. A similar role can be played by MAC algorithms.  ...  In multivariate cryptography, the public key is a system of multivariate polynomials over a small finite field.  ...  In multivariate cryptography, the public key is a system of multivariate polynomials over a small finite field.  ... 
doi:10.1002/0470863722.ch3 fatcat:kye7h3pmnbhkjksvyr4tj4nj7e

symmetric cryptography [chapter]

Martin H. Weik
2000 Computer Science and Communications Dictionary  
Digital signature algorithms (in combination with hash functions) replace hand-written signatures in electronic transactions. A similar role can be played by MAC algorithms.  ...  In multivariate cryptography, the public key is a system of multivariate polynomials over a small finite field.  ...  In multivariate cryptography, the public key is a system of multivariate polynomials over a small finite field.  ... 
doi:10.1007/1-4020-0613-6_18768 fatcat:24uzmmq3pbekxhlquwjzglnsve

Page 726 of Mathematical Reviews Vol. , Issue 99a [page]

1991 Mathematical Reviews  
A new class of constructions is proposed, based on error correcting codes over GF(2?) and a proof of security is given, which relates their security to that of single block hash functions.  ...  (English summary) Systems Sci. Math. Sci. 11 (1998), no.2, 161-167.  ... 

Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay

Xiang He, Aylin Yener
2013 IEEE Transactions on Information Theory  
The three main components of the proposed scheme are the nested lattice code, the privacy amplification scheme, and the algebraic manipulation detection (AMD) code.  ...  Specifically, for the Gaussian two-hop network, we show that lattice coding can successfully pair with AMD codes enabling its first application to a noisy channel model.  ...  Proof: We use "HRH" for "hash rule holds" for the AMD code tuple (49) This means the message will be accepted by node 2.  ... 
doi:10.1109/tit.2012.2216952 fatcat:n5k6nbk5hrfnnkgl4hivgg2mka

Lossy trapdoor functions and their applications

Chris Peikert, Brent Waters
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
Using NIZK proofs, CCA-secure cryptosystems have been constructed based on problems related to factoring and discrete logs [47, 23, 60, 19, 20] , but not lattices.  ...  lattice problems are known [51], they do not appear to suffice for CCA security.  ...  Second, while CPA-secure public key cryptosystems based on worst-case lattice assumptions are known [2, 56, 57] , there are still no known CCA-secure systems, because it is unknown how to realize NIZKs  ... 
doi:10.1145/1374376.1374406 dblp:conf/stoc/PeikertW08 fatcat:x5livcstg5ajtmltxzhgatovmy

Lossy Trapdoor Functions and Their Applications

Chris Peikert, Brent Waters
2011 SIAM journal on computing (Print)  
Using NIZK proofs, CCA-secure cryptosystems have been constructed based on problems related to factoring and discrete logs [47, 23, 60, 19, 20] , but not lattices.  ...  lattice problems are known [51], they do not appear to suffice for CCA security.  ...  Second, while CPA-secure public key cryptosystems based on worst-case lattice assumptions are known [2, 56, 57] , there are still no known CCA-secure systems, because it is unknown how to realize NIZKs  ... 
doi:10.1137/080733954 fatcat:aar54oj7angjfowcrtacu2hqye
« Previous Showing results 1 — 15 out of 562 results