sign in · help · news · about ·

BibSonomy :: user :: ytyoun ::

tag user group author concept BibTeX key search:all search:ytyoun

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(94)

<< < 1 | 2 | 3 > >>

How to Encipher Messages on a Small Domain
Ben Morris, Phillip Rogaway, and Till Stegers CRYPTO, volume 5677 of Lecture Notes in Computer Science, page 286-302. Springer, (2009)
to crypto imported thorp-shuffle by ytyoun and 1 other user on Dec 18, 2011, 8:03 PM
DOI | BibTeX (0)
Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings
Tal Rabin (Eds.). volume 6223 of Lecture Notes in Computer Science, Springer, (2010)
to 2010 crypto imported proceedings by ytyoun and 1 other user on Mar 24, 2011, 8:02 PM
BibTeX (0)
Parallel and Concurrent Security of the HB and HB$^+$ Protocols
Jonathan Katz, Ji Sun Shin, and Adam Smith J. Cryptology 23(3):402-421 (2010)
to concurrent crypto by ytyoun on Feb 18, 2011, 3:55 PM
DOI | BibTeX (0)
Cryptography Based on Bilinear Maps
Tatsuaki Okamoto AAECC, volume 3857 of Lecture Notes in Computer Science, page 35-50. Springer, (2006)
to crypto imported pairing by ytyoun and 1 other user on Sep 3, 2010, 10:03 PM
DOI | BibTeX (0)
Bit Encryption Is Complete
Steven Myers, and Abhi Shelat FOCS, page 607-616. IEEE Computer Society, (2009)
to crypto imported by ytyoun and 1 other user on Mar 7, 2010, 7:31 PM
DOI | BibTeX (0)
A Non-interactive Shuffle with Pairing Based Verifiability
Jens Groth, and Steve Lu ASIACRYPT, 4833/2007, page 51-67. (2007)
to crypto by ytyoun and 1 other user on Feb 28, 2010, 3:49 AM
DOI | BibTeX (0)
Efficient Non-interactive Proof Systems for Bilinear Groups
Jens Groth, and Amit Sahai EUROCRYPT, volume 4965 of Lecture Notes in Computer Science, page 415-432. Springer, (2008)
to NIZK crypto by ytyoun and 1 other user on Feb 28, 2010, 3:48 AM
URL | BibTeX (0)
P-signatures and Noninteractive Anonymous Credentials
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya TCC, volume 4948 of Lecture Notes in Computer Science, page 356-374. Springer, (2008)
to NIZK crypto by ytyoun and 1 other user on Feb 28, 2010, 3:47 AM
DOI | BibTeX (0)
Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings
Daniele Micciancio (Eds.). volume 5978 of Lecture Notes in Computer Science, Springer, (2010)
to 2010 crypto imported proceedings tcc by ytyoun and 1 other user on Feb 10, 2010, 12:47 AM
BibTeX (0)
A Pseudorandom Generator from any One-way Function
Johan H\aastad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby SIAM J. Comput. 28(4):1364-1396 (1999)
to crypto imported pseudorandom_generator by ytyoun on Jan 8, 2010, 3:57 AM
DOI | BibTeX (0)
A public key cryptosystem and a signature scheme based on discrete logarithms
Taher El Gamal IEEE Transactions on Information Theory 31(4):469-472 (1985)
to crypto el_gamal imported by ytyoun and 1 other user on Jan 4, 2010, 10:48 PM
DOI | BibTeX (0)
A unified framework for concurrent security: universal composability from stand-alone non-malleability
Huijia Lin, Rafael Pass, and Muthuramakrishnan Venkitasubramaniam STOC, page 179-188. ACM, (2009)
to crypto imported by ytyoun and 1 other user on Dec 3, 2009, 3:27 AM
DOI | BibTeX (0)
Non-malleability amplification
Huijia Lin, and Rafael Pass STOC, page 189-198. ACM, (2009)
to crypto imported non-malleability by ytyoun and 1 other user on Dec 3, 2009, 3:27 AM
BibTeX (0)
Concurrent Non-malleable Commitments from Any One-Way Function
Huijia Lin, Rafael Pass, and Muthuramakrishnan Venkitasubramaniam TCC, volume 4948 of Lecture Notes in Computer Science, page 571-588. Springer, (2008)
to commitment crypto imported non-malleability by ytyoun and 1 other user on Dec 3, 2009, 3:27 AM
DOI | BibTeX (0)
The Security of Individual RSA Bits
Johan H\aastad, and Mats Näslund FOCS, page 510-521. (1998)
to crypto focs hardcore_bit imported by ytyoun on Sep 9, 2009, 4:00 AM
BibTeX (0)
Proving Hard-Core Predicates Using List Decoding
Adi Akavia, Shafi Goldwasser, and Shmuel Safra FOCS, page 146-. IEEE Computer Society, (2003)
to 2003 crypto goldreich_levin hardcore_bit imported list_decoding by ytyoun and 1 other user on Sep 4, 2009, 1:54 AM
BibTeX (0)
The security of all RSA and discrete log bits
Johan H\aastad, and Mats Näslund J. ACM 51(2):187-230 (2004)
to crypto hardcore_bit imported by ytyoun on Sep 4, 2009, 1:52 AM
BibTeX (0)
Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings
Rusins Freivalds (Eds.). volume 2138 of Lecture Notes in Computer Science, Springer, (2001)
to 2001 crypto imported proceedings by ytyoun and 2 other users on Sep 4, 2009, 1:47 AM
BibTeX (0)
A Primitive for Proving the Security of Every Bit and About Universal Hash Functions \& Hard Core Bits
Eike Kiltz FCT, volume 2138 of Lecture Notes in Computer Science, page 388-391. Springer, (2001)
to crypto hardcore_bit imported by ytyoun and 1 other user on Sep 4, 2009, 1:47 AM
BibTeX (0)
Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, Cheju Island, Korea, February 13-15, 2001, Proceedings
Kwangjo Kim (Eds.). volume 1992 of Lecture Notes in Computer Science, Springer, (2001)
to 2001 crypto imported proceedings by ytyoun and 1 other user on Aug 22, 2009, 10:16 PM
BibTeX (0)

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper