The following pages link to Paz Morillo (Q989606):
Displayed 31 items.
- Item:Q989606 (redirect page) (← links)
- Extensions of access structures and their cryptographic applications (Q989607) (← links)
- Weighted threshold secret sharing schemes (Q1606940) (← links)
- Linear broadcast encryption schemes (Q1811106) (← links)
- Linear key predistribution schemes (Q1862446) (← links)
- Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
- Diameter-vulnerability of large bipartite digraphs (Q1917252) (← links)
- RLWE-based zero-knowledge proofs for linear and multiplicative relations (Q2177664) (← links)
- Cryptographic techniques for mobile ad-hoc networks (Q2462408) (← links)
- (Q2741393) (← links)
- On Dynamic Distribution of Private Keys over MANETs (Q2864179) (← links)
- Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts (Q2864362) (← links)
- The Kernel Matrix Diffie-Hellman Assumption (Q2958145) (← links)
- Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model (Q3011915) (← links)
- Easy Verifiable Primitives and Practical Public Key Cryptosystems (Q3404394) (← links)
- (Q3495375) (← links)
- CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts (Q3503869) (← links)
- The Security of All Bits Using List Decoding (Q3617510) (← links)
- (Q3625882) (← links)
- (Q3718760) (← links)
- (Q3734430) (← links)
- (Q3755475) (← links)
- (Q3792705) (← links)
- (Q3794087) (← links)
- (Q3832603) (← links)
- Fault-Tolerant Fixed Routings in Some Families of Digraphs (Q4210220) (← links)
- A Practical Public Key Cryptosystem from Paillier and Rabin Schemes (Q4414716) (← links)
- Comments on "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs" (Q4420992) (← links)
- How to Challenge and Cast Your e-Vote (Q5857773) (← links)
- Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\) (Q5938924) (← links)
- Lattice-Based Proof of a Shuffle (Q6166544) (← links)