285,151 Hits in 6.7 sec

A Generic Approach to Constructing and Proving Verifiable Random Functions [chapter]

Rishab Goyal, Susan Hohenberger, Venkata Koppula, Brent Waters
2017 Lecture Notes in Computer Science  
Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function evaluation  ...  Instead of tackling the VRF problem as a whole we demonstrate a simple and generic way of building Verifiable Random Functions from more basic and narrow cryptographic primitives.  ...  Acknowledgements We give a large thanks to David Zuckerman for helpful discussions regarding the error correcting code described in Section 5. 3 .  ... 
doi:10.1007/978-3-319-70503-3_18 fatcat:hmchem7wdjhafibgorsmox6cze

Constructing Verifiable Random Functions with Large Input Spaces [chapter]

Susan Hohenberger, Brent Waters
2010 Lecture Notes in Computer Science  
Our construction is practical and inspired by the pseudorandom functions of Naor and Reingold and the verifiable random functions of Lysyanskaya.  ...  We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a noninteractive complexity assumption.  ...  Meeting these two restrictions will require a new approach to constructing pseudorandom functions that moves past traditional constructions.  ... 
doi:10.1007/978-3-642-13190-5_33 fatcat:abhvgc3x2jbb7ffqax5bx6vrqi

Time Transitive Functions for Zero Knowledge Proofs [article]

Ekleen Kaur, Gokul Alex
2021 arXiv   pre-print
Verifiable delay functions have found a lot of applications in blockchain technology in recent times.  ...  We are proposing the application of VDF for constructing more space time-efficient provers and simulators required for the iterative non-interactive zero-knowledge systems.  ...  The proving key pk and verifying key vk are later used by P and V in the proof generation and verification phases.  ... 
arXiv:2108.06389v1 fatcat:dc4hp5hvnbeyloziw3losi6ddu

Non-Interactive Zero-Knowledge Proofs of Non-Membership [chapter]

Olivier Blazy, Céline Chevalier, Damien Vergnaud
2015 Lecture Notes in Computer Science  
Our construction is generic and relies on the corresponding proof of membership to L.  ...  In 2009, Kiayias and Zhou introduced zero-knowledge proofs with witness elimination which enable to prove that a committed message m belongs to a set L in such a way that the verifier accepts the interaction  ...  Proof of No-Statement Generic Technique In this section, we are going to present a way to prove exclusion statement, following a Commit and Prove approach ( [CLOS02] ).  ... 
doi:10.1007/978-3-319-16715-2_8 fatcat:ccypmrgasrekxffeii6c6desgi

Enhancing privacy of federated identity management protocols

Jan Camenisch, Thomas Gross, Dieter Sommer
2006 Proceedings of the 5th ACM workshop on Privacy in electronic society - WPES '06  
We put forth a general construction for integrating anonymous credential systems with the XML Signature Standard and FIM protocols.  ...  We apply this method to the WS-Security protocol framework and thus obtain a very flexible WS-Federation Active Requestor Profile with strong user control and superior privacy protection.  ...  The function has been proved to be pseudo random in the generic group model [5] .  ... 
doi:10.1145/1179601.1179613 dblp:conf/wpes/CamenischGS06 fatcat:okr3w5nhgrfwxkrnqxwuzhtljy

Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions [chapter]

Veronika Kuchta, Mark Manulis
2013 Lecture Notes in Computer Science  
In order to construct VRFs from unique signatures one first needs to construct a so-called Verifiable Unpredictable Function (VUF) and then apply the transformation from [25] to convert VUF into VRF.  ...  The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom  ...  Distributed Verifiable Random Functions Distributed Verifiable Random Functions (DVRF) were introduced by Dodis [11] .  ... 
doi:10.1007/978-3-319-02937-5_14 fatcat:a4xr7hh6zrae3dqejrsodcajoe

Algebraic Construction for Zero-Knowledge Sets

Rui Xue, Ning-Hui Li, Jiang-Tao Li
2008 Journal of Computer Science and Technology  
That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain.  ...  In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.  ...  generates a commitment of an arbitrary set, prove gives non-interactive proof for any queries, and verify verifies the proofs generated by prove.  ... 
doi:10.1007/s11390-008-9119-x fatcat:oouf3erpnrbotmztavahrd72ja

Scalable Zero Knowledge via Cycles of Elliptic Curves [chapter]

Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
2014 Lecture Notes in Computer Science  
(STOC '13), following Valiant (TCC '08), offers an approach to scalability, by recursively composing proofs: proving statements about acceptance of the proof system's own verifier (and correctness of the  ...  Recently, much research has focused on achieving an additional property, succinctness, requiring the proof to be very short and easy to verify.  ...  We thank Damien Stehlé and Daniele Micciancio for discussions about the security of subset-sum functions. We thank Koray Karabina for answering questions about algorithms in [KT08] .  ... 
doi:10.1007/978-3-662-44381-1_16 fatcat:3c5pp6k5qrfnzpopez7mfvnjdy

From Computationally-proved Protocol Specifications to Implementations

David Cade, Bruno Blanchet
2012 2012 Seventh International Conference on Availability, Reliability and Security  
We have applied this compiler to the SSH Transport Layer protocol: we proved the authentication of the server and the secrecy of the session keys in this protocol and verified that the generated implementation  ...  This paper presents a novel framework for proving specifications of security protocols in the computational model and generating runnable implementations from such proved specifications.  ...  key K ab by generating a random seed rK ab and using the key generation algorithm kgen on it.  ... 
doi:10.1109/ares.2012.63 dblp:conf/IEEEares/CadeB12 fatcat:adm45ewwmfbpzhy4pjuxtcch5m

Probabilistic Analysis of Wireless Systems Using Theorem Proving

Osman Hasan, Sofiène Tahar
2009 Electronical Notes in Theoretical Computer Science  
Probabilistic techniques play a major role in the design and analysis of wireless systems as they contain a significant amount of random or unpredictable components.  ...  The paper presents a concise description of the formal foundations required to conduct the analysis of a wireless system in a theorem prover, such as, the higher-order-logic modeling of random variables  ...  The foremost criteria for implementing a theorem proving based probabilistic analysis framework is to be able to formalize and verify random variables in higher-order logic.  ... 
doi:10.1016/j.entcs.2009.06.022 fatcat:b4vone4zjjdxnmfie6skiaqg6i

A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN [chapter]

Melissa Chase, Markulf Kohlweiss
2012 Lecture Notes in Computer Science  
The traditional approach of applying a collision resistant hash function from M1 to M2 can be inconvenient when the signature scheme is used within more complex protocols, for example if we want to prove  ...  Here, we present an alternative approach in which we can combine a signature for M1, a pairwise independent hash function with key space M1 and message space M2, and a non-interactive zero knowledge proof  ...  The prover runs PKProve(crs, x, w) to prove statement x with witness w which generates a proof π. The verifier runs PKVerify(crs, x, π) to verify the proof.  ... 
doi:10.1007/978-3-642-32928-9_8 fatcat:leym54knzrfdrirlkt6egocsi4

Resettable Statistical Zero Knowledge [chapter]

Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia
2012 Lecture Notes in Computer Science  
Moreover, under the assumption that (standard) one-way functions exist, all languages L such that the complement of L is random self reducible, admit a rSZK; in other words: co-RSR ⊆ rSZK.  ...  Furthermore, for these languages we construct a two-round resettable statistical witness-indistinguishable argument system.  ...  Like their construction we use similar ID commitments but our general approach and overall protocol is different from their approach.  ... 
doi:10.1007/978-3-642-28914-9_28 fatcat:6ev3fb7lcjdsvkkcixtwqkjjla

Enhanced Chosen-Ciphertext Security and Applications [chapter]

Dana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill
2014 Lecture Notes in Computer Science  
of a randomness-recovery algorithm associated to the scheme.  ...  The first standard-model construction of CCA-secure randomness-recovering PKE was achieved by Peikert and Waters [29] , based on their new concept of "lossy" trapdoor functions (TDFs).  ...  The fourth author was supported by NSF grants CNS-1012910 and CNS-0546614.  ... 
doi:10.1007/978-3-642-54631-0_19 fatcat:rn24bxdhjvfibjmb54btwnpk4u

Formal Probabilistic Analysis: A Higher-Order Logic Based Approach [chapter]

Osman Hasan, Sofiène Tahar
2010 Lecture Notes in Computer Science  
Recently, a significant amount of formalization has been done in higherorder logic that allows us to conduct precise probabilistic analysis using theorem proving and thus overcome the limitations of the  ...  Some major contributions include the formalization of both discrete and continuous random variables and the verification of some of their corresponding probabilistic and statistical properties.  ...  The first step in the proposed approach is to construct a model of the given system in higher-order-logic.  ... 
doi:10.1007/978-3-642-11811-1_2 fatcat:hhk4xlpnevflrf2w3ijc3hweni

Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations [chapter]

Dario Fiore, Dominique Schröder
2012 Lecture Notes in Computer Science  
-Second, the notion of VRFs is closely related to weak verifiable random functions and verifiable pseudorandom generators which are both implied by TDPs.  ...  Towards this direction, Brakerski et al. showed that verifiable random functions cannot be constructed from one-way permutations in a black-box way.  ...  We would like to thank Yevgeniy Vahlis for helpful clarifications about black-box separation techniques and Michel Abdalla for helpful discussions on this work.  ... 
doi:10.1007/978-3-642-28914-9_36 fatcat:77e3qv3zpfeghicra6ojbmqsyy
« Previous Showing results 1 — 15 out of 285,151 results