8,940 Hits in 2.2 sec

Pseudorandom signatures

Nils Fleischhacker, Felix Günther, Franziskus Kiefer, Mark Manulis, Bertram Poettering
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
We show that one way towards pseudorandom signatures leads over our mid-level notion, called indistinguishability: such signatures can be simulated using only the public parameters of the scheme.  ...  The top notion in our hierarchy is pseudorandomness: signatures with this property hide the entire information about the signing process and cannot be recognized as signatures when transmitted over a public  ...  Definition 7 ( 7 Pseudorandom Signatures).  ... 
doi:10.1145/2484313.2484325 dblp:conf/ccs/FleischhackerGKMP13 fatcat:2nf7klv2j5drbl3j4jhy6mhxvy

Functional Signatures and Pseudorandom Functions [chapter]

Elette Boyle, Shafi Goldwasser, Ioana Ivan
2014 Lecture Notes in Computer Science  
We introduce two new cryptographic primitives: functional digital signatures and functional pseudorandom functions.  ...  We show applications of functional signatures to constructing succinct non-interactive arguments and delegation schemes.  ...  pseudorandom functions [23] .  ... 
doi:10.1007/978-3-642-54631-0_29 fatcat:6mr73ixjp5bthnw6wquhlyjgbe

Signature attractor based pseudorandom generation algorithm

Krasimir Kordov
2015 Advanced Studies in Theoretical Physics  
We study a chaotic attractor based pseudorandom generation algorithm. The novel scheme use a signature attractor and the logical XOR function.  ...  The aim of the paper is to present a pseudorandom bit generator based Signature attractor.  ...  The novel algorithm has excellent statistical properties. 2 Signature Attractor based Pseudorandom Generation Algorithm Proposed scheme The Signature attractor is presented in [10] , Eq. (1): x t+1  ... 
doi:10.12988/astp.2015.517 fatcat:yzkkwqumgnhm3nkoo64wtamqzy

Lattice‐based nominative signature using pseudorandom function

Meenakshi Kansal, Ratna Dutta, Sourav Mukhopadhyay
2021 IET Information Security  
A nominative signature (NS) is a cryptographic primitive where two parties collude to produce a signature.  ...  The authors' construction relies on collision-resistant preimage sampleable function and symmetric key primitives like collision-resistant pseudorandom function and zero knowledge proof system ZKB++ for  ...  By the pseudorandom property of f, this simulation is same as in the real protocol.  ... 
doi:10.1049/ise2.12022 fatcat:6yngubs6hndczf5eai6tjhixkm

XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions [chapter]

Johannes Buchmann, Erik Dahmen, Andreas Hülsing
2011 Lecture Notes in Computer Science  
It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family.  ...  Its signature size is reduced to less than 25% compared to the best provably secure hash based signature scheme.  ...  Signature key generation The W-OTS secret signature keys are computed using a seed Seed ∈ {0, 1} n , the pseudorandom function family F (n), and the pseudorandom generator GEN which for λ, µ ∈ {0, 1} n  ... 
doi:10.1007/978-3-642-25405-5_8 fatcat:rteojej5rnfpfiountjk4hgwni

"Pseudorandom Intermixing": A Tool for Shared Cryptography [chapter]

Yair Frankel, Philip MacKenzie, Moti Yung
2000 Lecture Notes in Computer Science  
pseudorandom information inside their computational results.  ...  Here, we suggest a new modular tool that we call "pseudorandom intermixing" which allows parties (or architectural components, such as hardware devices) sharing pseudorandomness to mix extra correlated  ...  Fig. 3 . 3 Secure non-interactive threshold RSA signature generation with pseudorandom intermixing Theorem 2.  ... 
doi:10.1007/978-3-540-46588-1_21 fatcat:4bk7n5hyd5a5hf6bekpx6ilcfe

Efficient Sanitizable Signatures Without Random Oracles [chapter]

Russell W. F. Lai, Tao Zhang, Sherman S. M. Chow, Dominique Schröder
2016 Lecture Notes in Computer Science  
Function Pseudorandom Generator Digital Signatures Construction I Re-randomizable Tagging Ingredients Pseudorandom Function Pseudorandom Generator Digital Signatures Extractable Public  ...  Key Encryption m ← Ext(pk, c, r ), r = encryption randomness Construction I Re-randomizable Tagging Ingredients Pseudorandom Function Pseudorandom Generator Digital Signatures Construction  ... 
doi:10.1007/978-3-319-45744-4_18 fatcat:vjy4j5qy2ffxfozbhyg54cuvxy


2007 International Conference on Aerospace Sciences and Aviation Technology  
This testing system approach is designed to apply the test pattern generated either by a pseudorandom test pattern generator (PRTPG) or by a deterministic test pattern generator (DTPG) to the circuit under  ...  It is designed to receive the signature automatically. Good signatures are generated from the good CUT and the measured signatures are generated from the CUT.  ...  The generated signature from either pseudorandom testing or deterministic testing is automatically transferred to the PC through the interface unit.  ... 
doi:10.21608/asat.2007.23967 fatcat:fvmcw7fbnndivod2a7ij36dk5y

On the foundations of modern cryptography [chapter]

Oded Goldreich
1997 Lecture Notes in Computer Science  
"a signature scheme that is robust against chosen message attack cannot have a proof of security".  ...  Another existing concept which was re-examined is the then-fuzzy notion of a "pseudorandom generator".  ...  Pseudorandom functions may be used to eliminate the need to store the values of intermediate vertices used in previous signatures [60] .  ... 
doi:10.1007/bfb0052227 fatcat:g5eprxwuwncivbinj4qkonpvbe

Efficient strong designated verifier signature schemes without random oracle or with non-delegatability

Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
2011 International Journal of Information Security  
It has tight security reduction to the DDH assumption and the security of the underlying pseudorandom functions.  ...  Abstract Designated verifier signature (DVS) allows a signer to convince a designated verifier that a signature is generated by the signer without letting the verifier transfer the conviction to others  ...  Since the pseudorandom function is deterministic, there is only one signature on each message. Hence, the simulation of oracle O Sign is perfect.  ... 
doi:10.1007/s10207-011-0146-1 fatcat:ry2uo5xk5jhtfjen3gyjlyjf2e

One Way Functions –Conjecture, Status, Applications and Future Research Scope

Amit Sharma, Sunil Kr.
2016 International Journal of Computer Applications  
Pseudorandom generators A pseudorandom generator (PRG) is a deterministic function which maps the random uniform bit input to a pseudorandom longer bit string output which cannot be distinguished from  ...  Digital signature schemes The idea of digital signature scheme [14] stems from the papers of Diffie and Hellman [3] followed by Rivest, Shamir and Adelman [11] .  ... 
doi:10.5120/ijca2016912126 fatcat:jttkqoy3ercupctqpyqmtyphsu

A Threshold Pseudorandom Function Construction and Its Applications [chapter]

Jesper Buus Nielsen
2002 Lecture Notes in Computer Science  
We give the first construction of a practical threshold pseudorandom function.  ...  As part of the implementation we show how to replace the random oracles in the threshold signature scheme from [Sho00] by our threshold pseudorandom function.  ...  Our threshold signature protocol π tsig,c is given by the following description.  ... 
doi:10.1007/3-540-45708-9_26 fatcat:7aqzyodt75e2pokvxcrg5w75hu

Watermarking PRFs from Lattices: Public Extract and Collusion Resistant [article]

Yukun Wang, Mingqiang Wang
2021 IACR Cryptology ePrint Archive  
At present, the construction of software watermarking mainly focuses on watermarking pseudorandom functions (PRFs), watermarking public key encryption, watermarking signature, etc.  ...  In our schemes, we use the constrained signature to mark a PRF circuit.  ...  Pseudorandomness.  ... 
dblp:journals/iacr/WangW21 fatcat:l6r5rjw5vrbwhfor4etdjepvwu

G-Merkle: A Hash-Based Group Signature Scheme from Standard Assumptions [chapter]

Rachid El Bansarkhani, Rafael Misoczki
2018 Lecture Notes in Computer Science  
Moreover, for N group members issuing at most B signatures each, the size of a hash-based group signature is just as large as a Merkle signature with a tree composed by N · B leaf nodes.  ...  Hash-based signature schemes are the most promising cryptosystem candidates in a post-quantum world, but offer little structure to enable more sophisticated constructions such as group signatures.  ...  By use of a suitable pseudorandom function, we can instantiate the group signature scheme with a secure SPRP with the aid of Theorem 1.  ... 
doi:10.1007/978-3-319-79063-3_21 fatcat:4mpqtc4nove3vaqeej2b7ubhpe

Fully Distributed Verifiable Random Functions and their Application to Decentralised Random Beacons [article]

David Galindo, Jia Liu, Mihai Ordean, Jin-Mann Wong
2020 IACR Cryptology ePrint Archive  
but not pseudorandom (e.g. signatures could contain some bias and be distinguishable from a random distribution).  ...  : There are similarities between a VRF and a digital signature scheme with unique signatures.  ...  Adversarial capabilities in standard pseudorandomness of Dfinity-DVRF and unforgeability of threshold BLS signatures [11] go hand in hand, as in both cases an adversary is not given the option to make  ... 
dblp:journals/iacr/GalindoLOW20 fatcat:rtouzvkyb5bwvjkxa4hejv25cm
« Previous Showing results 1 — 15 out of 8,940 results