-
Notifications
You must be signed in to change notification settings - Fork 167
Cryptographic schemes and protocols
jakinyele edited this page Apr 3, 2013
·
5 revisions
Scheme | Group Setting | Status | Paper |
---|---|---|---|
RSA-OAEP | Integer | DONE | Bellare, M., and Rogaway, P. Optimal asymmetric encryption padding – How to encrypt with RSA. EUROCRYPT ’94 |
CS-98 | EC/Integer | DONE | Cramer, R., and Shoup, V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. CRYPTO ’98 |
El Gamal | EC/Integer | DONE | Blakley, G., Chaum, D., and ElGamal, T. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. Springer Berlin ’85 |
Paillier99 | Integer | DONE | Stern, J., and Paillier, P. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Springer Berlin ’99 |
Rabin | Integer | DONE | Digitalized Signatures and Public-Key Functions as Intractable as Factorization. MIT Labs ’79. |
BFO1 | Pairing | DONE | Boneh, D., and Franklin, M. K. Identity-based encryption from the Weil Pairing. CRYPTO ’01 |
BB04 | Pairing | DONE | Boneh, D., and Boyen, X. Efficient selective-ID secure Identity-Based Encryption without random oracles. EUROCRYPT ’04 |
Naccache05 | Pairing | DONE | David Naccache Secure and Practical Identity-Based Encryption. ePrint ’05 |
BGW05 | Pairing | DONE | Boneh, B., Gentry, C., and Waters, B. Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Key. CRYPTO ’05. |
SW05 | Pairing | DONE | Sahai, A., and Waters, B. Fuzzy identity-based encryption. EUROCRYPT ’05 |
BSW07 | Pairing | DONE | Bethencourt, J., Sahai, A., and Waters, B. Ciphertext-policy Attribute-Based Encryption. IEEE Oakland S&P ’07 |
HVE08 | Pairing | DONE | Iovino, V., Persiano, G. Hidden-vector encryption with groups of prime order. Pairing ’08. |
LSW09 | Pairing | DONE | Lewko, A., Sahai, A., and Waters, B. Revocation systems with very small private keys. IEEE Oakland S&P ’10 |
Waters11 | Pairing | DONE | Waters, B. Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. PKC ’11 |
LW11 | Pairing | DONE | Multi-authority CP-ABE: Lewko, A., and Waters, B. Decentralizing attribute-based encryption. EUROCRYPT ’11 |
Scheme | Group Setting | Status | Paper |
---|---|---|---|
RSA-PSS | Integer | DONE | Bellare, M., and Rogaway, P. The exact security of digital signatures: How to sign with RSA and Rabin. EUROCRYPT ’96. |
Schnorr | Integer | DONE | Brassard, G., and Schnorr, C. Efficient Identication and Signatures for Smart Cards, Springer Berlin ’90. |
DSA | EC/Integer | DONE | NIST. Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186, ’94. |
HW09 | Integer/Pairing | DONE | Hohenberger, S., and Waters, B. Realizing hash-and-sign signatures under standard assumptions. EUROCRYPT ’09. |
BLS03 | Pairing | DONE | Short Sig: Boneh, D., Lynn, B., and Shacham, H. Short signatures from the weil pairing. ASIACRYPT ’01 |
BBSO4 | Pairing | DONE | Group Sig: Boneh, D., Boyen, X., and Shacham, H. Short group signatures. CRYPTO ’04 |
CHP | Pairing | DONE | Jan Camenisch, Susan Hohenberger, and Michael Østergaard Pedersen. Batch verification of short signatures. EUROCRYPT ’07. |
Hess02 | Pairing | DONE | Florian Hess. Efficient identity based signature schemes based on pairings. Selected Areas in Cryptography, ’02. |
ChCh03 | Pairing | DONE | Jae Choon Cha and Jung Hee Cheon. An identity-based signature from gap Diffie-Hellman groups. PKC ’03. |
Waters05 | Pairing | DONE | Brent Waters. Efficient identity-based encryption without random oracles. EUROCRYPT ’05. |
CL02 | Strong-RSA | DONE | Camenisch, J., Lysyanskaya, A. A Signature Scheme with Efficient Protocols. SCN ’02. |
CL04 | Pairing | DONE | Camenisch, J., Lysyanskaya, A. Signature Schemes and Anonymous Credentials from Bilinear Maps. CRYPTO ’04. |
CYH05 | Pairing | DONE | Sherman S. M. Chow, Siu-Ming Yiu, and Lucas C.K. Hui. Efficient identity based ring signature. ACNS ’05. |
Boyen07 | Pairing | DONE | X. Boyen. Mesh Signatures: How to Leak a Secret with Unwitting and Unwilling Participants. EUROCRYPT ’07. |
VRF10 | Pairing | DONE | Hohenberger, S., and Waters, B. Constructing Verifiable Random Functions with Large Input Spaces. EUROCRYPT ’10. |
Scheme | Group Setting | Status | Paper |
---|---|---|---|
GS07 | Pairing | DONE | Groth, J., and Sahai, A. Efficient non-interactive proof systems for bilinear groups. EUROCRYPT ’08. |
Pedersen | EC/Integer | DONE | Pedersen, T. P. Non-interactive and information-theoretic secure veriable secret sharing. CRYPTO ’92. |
Scheme | Group Setting | Status | Paper |
---|---|---|---|
Adm05 | Integer | DONE | Chameleon Hash: Ateniese, G., and de Medeiros, B. On the key exposure problem in chameleon hashes. SCN ’04. |
HW09 | Integer | DONE | Chameleon Hash: Hohenberger, S., and Waters, B. Realizing hash-and-sign signatures under standard assumptions. EUROCRYPT ’09. |
Scheme | Group Setting | Status | Paper |
---|---|---|---|
Schnorr91 | EC/Integer | DONE | Schnorr, C.-P. Efficient signature generation for smart cards. Cryptology ’91. |
CNS07 | Pairing | DONE | Camenisch, J., Neven, G., and abhi shelat. Simulatable adaptive oblivious transfer. EUROCRYPT ’07. |
Scheme | Group Setting | Status | Paper |
---|---|---|---|
Naor01 | Pairing | DONE | Moni Naor generic IBE-to-Signature tansform based on Boneh-Franklin IBE. |
CHK04 | Pairing | DONE | R. Canneti, S. Halevi, J. Katz: Chosen-Ciphertext Security from Identity-Based Encryption. CRYPTO ’04. |
BCHK04 | Pairing | DONE | D. Boneh and J. Katz. Improved Efficiency for CCA-secure Cryptosystems Built using IBE. CT-RSA ’05. |
HybIBEnc | Pairing | DONE | An identity-based hybrid encryption adapter |
HybPKEnc | Pairing | DONE | A public-key hybrid encryption adapter |
HybABEnc | Pairing | DONE | An attribute-based hybrid encryption adapter |
HybDABEnc | Pairing | DONE | A multi-authority attribute-based hybrid encryption adapter |
This is a running list of schemes we are currently implementing in Charm or hope to implement within the next few months. They are as follows:
- Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations
- http://eprint.iacr.org/2011/222.pdf
- Oenssl-based implementation (http://www.cs.bu.edu/~goldbe/papers/bgpsec-sigs.html)
- Key Agreement from Close Secrets over Unsecured Channels (suggested by Leonid Reyzin)
- http://eprint.iacr.org/2008/494.pdf
- Provable Data Possession
- http://cseweb.ucsd.edu/~hovav/papers/sw08.html
- Searchable Private-Key Encryption
- Identity-Based Encryption without Pairings
- http://crypto.stanford.edu/~dabo/pubs/abstracts/bgh.html
- Predicate Encryption
- Groth-Sahai Pairing-based ZK Proofs
- http://eprint.iacr.org/2009/599.pdf
- Collusion-Resistant Obfuscation and Functional Encryption
- http://eprint.iacr.org/2011/337.pdf
- Josh Beneloh – append-only bulletin board for Voting protocols