rueckert's library 60 articles Export

	Public-Key Encryption in the Bounded-Retrieval Model [My Copy] (21 Oct 2009) by Joel Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs posted to no-tag by rueckert on 2009-11-19 07:18:04 as
	Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions [My Copy] (6 Aug 2009) by Brent Waters posted to hibe by rueckert on 2009-11-19 07:11:12 as
	Efficient Identity-Based Encryption Without Random Oracles [My Copy] Advances in Cryptology – EUROCRYPT 2005 (2005), pp. 114-127. by Brent Waters posted to no-tag by rueckert on 2009-11-19 07:10:48 as
	Short and Stateless Signatures from the RSA Assumption [My Copy] Advances in Cryptology - CRYPTO 2009 (2009), pp. 654-670. by Susan Hohenberger, Brent Waters posted to no-tag by rueckert on 2009-11-19 07:10:37 as
	Strongly Unforgeable Signatures Based on Computational Diffie-Hellman [My Copy] Public Key Cryptography - PKC 2006 (2006), pp. 229-240. by Dan Boneh, Emily Shen, Brent Waters posted to no-tag by rueckert on 2009-11-19 07:10:25 as
	Efficient Public Key Encryption Based on Ideal Lattices [My Copy] (16 Jun 2009) by Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa posted to no-tag by rueckert on 2009-09-07 10:06:47 as along with 1 person dankamongmen
	Random oracles are practical: a paradigm for designing efficient protocols [My Copy] In CCS '93: Proceedings of the 1st ACM conference on Computer and communications security (1993), pp. 62-73. by Mihir Bellare, Phillip Rogaway posted to no-tag by rueckert on 2009-07-22 10:52:59 as
	RSA-OAEP Is Secure under the RSA Assumption [My Copy] Journal of Cryptology, Vol. 17, No. 2. (28 March 2004), pp. 81-104. by Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern posted to no-tag by rueckert on 2009-07-22 10:05:04 as
	How to Delegate a Lattice Basis [My Copy] (19 Jul 2009) by David Cash, Dennis Hofheinz, Eike Kiltz posted to no-tag by rueckert on 2009-07-22 08:04:18 as
	Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography) [My Copy] (19 Jul 2009) by Chris Peikert posted to no-tag by rueckert on 2009-07-22 08:02:51 as along with 1 person dankamongmen
	Compact McEliece Keys from Goppa Codes [My Copy] (30 Apr 2009) by Rafael Misoczki, Paulo S. L. M. Barreto posted to no-tag by rueckert on 2009-07-14 07:44:52 as
	The Composite Discrete Logarithm and Secure Authentication [My Copy] Public Key Cryptography (2000), pp. 113-128. by David Pointcheval posted to no-tag by rueckert on 2009-06-12 17:07:24 as
	A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions [My Copy] Advances in Cryptology — EUROCRYPT 2003 (2003), pp. 642-642. by Yehuda Lindell posted to no-tag by rueckert on 2009-06-12 14:52:16 as
	Chosen-Ciphertext Security via Correlated Products [My Copy] (14 Mar 2008) by Alon Rosen, Gil Segev posted to no-tag by rueckert on 2009-06-10 09:06:23 as
	Quantum Algorithm for the Collision Problem [My Copy] (1 May 1997) by Gilles Brassard, Peter Hoyer, Alain Tapp posted to no-tag by rueckert on 2009-04-20 09:56:07 as
	Privacy-Enhancing First-Price Auctions Using Rational Cryptography [My Copy] (30 Sep 2008) by Peter B. Miltersen, Jesper B. Nielsen, Nikos Tri, Opoulos posted to no-tag by rueckert on 2009-04-08 07:47:31 as
	Worst-Case to Average-Case Reductions Based on Gaussian Measures [My Copy] SIAM Journal on Computing, Vol. 37, No. 1. (2007), pp. 267-302. by Daniele Micciancio, Oded Regev posted to no-tag by rueckert on 2009-03-13 11:51:28 as
	Verifiable encryption of digital signatures and applications [My Copy] ACM Trans. Inf. Syst. Secur., Vol. 7, No. 1. (2004), pp. 1-20. by Giuseppe Ateniese posted to no-tag by rueckert on 2009-03-12 11:19:53 as
	Practical Verifiable Encryption and Decryption of Discrete Logarithms [My Copy] In CRYPTO, Vol. 2729 (2003), pp. 126-144. by Jan Camenisch, Victor Shoup edited by Dan Boneh, Dan Boneh posted to no-tag by rueckert on 2009-03-12 11:19:41 as
	Simulatable Adaptive Oblivious Transfer [My Copy] Advances in Cryptology - EUROCRYPT 2007 (2007), pp. 573-590. by Jan Camenisch, Gregory Neven, Abhi Shelat posted to no-tag by rueckert on 2009-03-09 09:54:25 as
	A Brief History of Provably-Secure Public-Key Encryption [My Copy] (20 Feb 2009) by Alex, Er W. Dent posted to no-tag by rueckert on 2009-02-24 12:31:52 as
	Fair Blind Signatures Revisited [My Copy] Pairing-Based Cryptography – Pairing 2007 (2007), pp. 268-292. by Emeline Hufschmitt, Jacques Traoré posted to blind by rueckert on 2009-01-28 06:52:56 as
	Optimistic Fair Exchange in a Multi-user Setting [My Copy] Public Key Cryptography – PKC 2007 (2007), pp. 118-133. by Yevgeniy Dodis, Pil Lee, Dae Yum posted to ves by rueckert on 2009-01-26 07:09:44 as
	Constructions of Truly Practical Secure Protocols using Standard Smartcards [My Copy] (20 Jan 2009) by Carmit Hazay, Yehuda Lindell posted to no-tag by rueckert on 2009-01-26 06:39:17 as
	Realizing Hash-and-Sign Signatures under Standard Assumptions [My Copy] (12 Jan 2009) by Susan Hohenberger, Brent Waters posted to no-tag by rueckert on 2009-01-19 09:32:49 as
	Breaking Knapsack Cryptosystems by l 1--norm Enumeration [My Copy] by H. Ritter posted to lattice reduction by rueckert on 2008-12-18 13:09:52 as
	Generating Shorter Bases for Hard Random Lattices [My Copy] (12 Dec 2008) by Joel Alwen, Chris Peikert posted to avarage-case lattice svp worst-case by rueckert on 2008-12-18 12:57:36 as
	Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem [My Copy] (13 Nov 2008) by Chris Peikert posted to lattice svp by rueckert on 2008-12-18 12:57:18 as
	Multi-signatures in the plain public-Key model and a general forking lemma [My Copy] In CCS '06: Proceedings of the 13th ACM conference on Computer and communications security (2006), pp. 390-399. by Mihir Bellare, Gregory Neven posted to blind by rueckert on 2008-12-04 07:48:02 as
	Secure Parameters for SWIFFT [My Copy] (25 Nov 2008) by Johannes Buchmann, Richard Lindner posted to hash-function lattice post-quantum by rueckert on 2008-12-02 07:24:34 as
	The $n^c$-Unique Shortest Vector Problem is Hard [My Copy] (30 Nov 2008) by Vadim Lyubashevsky posted to lattice reduction svp by rueckert on 2008-12-02 06:54:00 as
	SWIFFTX - The ECRYPT Hash Function Website [My Copy] by Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen posted to hash-function lattice by rueckert on 2008-11-20 06:51:02 as
	The optimal LLL algorithm is still polynomial in fixed dimension [My Copy] Theoretical Computer Science, Vol. 297, No. 1-3. (17 March 2003), pp. 3-23. by A. Akhavi posted to lattice by rueckert on 2008-11-17 06:51:41 as
	Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems [My Copy] Advances in Cryptology – CRYPTO 2008 (2008), pp. 536-553. by Chris Peikert, Vinod Vaikuntanathan posted to no-tag by rueckert on 2008-11-06 14:38:11 as
	Lossy trapdoor functions and their applications [My Copy] In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing (2008), pp. 187-196. by Chris Peikert, Brent Waters posted to no-tag by rueckert on 2008-11-06 14:37:51 as
	SWIFFT: A Modest Proposal for FFT Hashing [My Copy] Fast Software Encryption (2008), pp. 54-72. by Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen posted to avarage-case hash-function reduction svp worst-case by rueckert on 2008-10-24 12:19:05 as
	How Risky is the Random-Oracle Model? [My Copy] (13 Oct 2008) by Gaetan Leurent, Phong Q. Nguyen posted to no-tag by rueckert on 2008-10-21 18:23:13 as
	On Lovász’ lattice reduction and the nearest lattice point problem [My Copy] Combinatorica, Vol. 6, No. 1. (1 March 1986), pp. 1-13. by L. Babai posted to cvp lattice by rueckert on 2008-10-14 12:22:38 as
	Ordered Multisignatures and Identity-Based Sequential Aggregate Signatures, with Applications to Secure Routing [My Copy] (25 Nov 2007) by Alex, Ra Boldyreva, Craig Gentry, Adam O'Neill, Dae H. Yum posted to generic-group-model by rueckert on 2008-10-06 14:58:05 as
	Signing a Linear Subspace: Signature Schemes for Network Coding [My Copy] (31 Jul 2008) by Dan Boneh, David Freeman, Jonathan Katz, Brent Waters posted to rom rom-free signature by rueckert on 2008-10-01 09:26:16 as
	Lattice-Based Identification Schemes Secure Under Active Attacks [My Copy] Public Key Cryptography – PKC 2008 (2008), pp. 162-179. by Vadim Lyubashevsky posted to lattice post-quantum proofs by rueckert on 2008-09-30 14:14:03 as
	Hash Functions from Sigma Protocols and Improvements to VSH [My Copy] (5 Sep 2008) by Mihir Bellare, Todor Ristov posted to hash-function zero-knowledge by rueckert on 2008-09-30 14:04:09 as
	Unique Shortest Vector Problem for max norm is NP-hard [My Copy] (25 Aug 2008) by Than Q. Khoat, Nguyen H. Tan posted to lattice post-quantum svp by rueckert on 2008-09-30 14:02:35 as
	Pairings for Cryptographers [My Copy] (9 May 2006) by S. D. Galbraith, K. G. Paterson, N. P. Smart posted to bilinear-maps pairing by rueckert on 2008-09-17 08:29:39 as
	On computable isomorphisms in efficient asymmetric pairing-based systems [My Copy] Discrete Applied Mathematics, Vol. 155, No. 4. (15 February 2007), pp. 538-547. by N. P. Smart, F. Vercauteren posted to bilinear-maps pairing by rueckert on 2008-09-17 08:26:29 as
	Hierarchical Identity Based Encryption with Constant Size Ciphertext [My Copy] (20 Jan 2005) by Dan Boneh, Xavier Boyen, Eu-Jin Goh posted to no-tag by rueckert on 2008-08-18 08:43:01 as
	A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures [My Copy] Advances in Cryptology — EUROCRYPT 2001 (2001), pp. 136-151. by Masayuki Abe posted to blind signature whitness-indistinguishable by rueckert on 2008-08-15 10:38:35 as
	Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions [My Copy] Theory of Cryptography (2007), pp. 323-341. by Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell posted to blind signature witness-indistinguishable zap by rueckert on 2008-08-05 09:51:58 as
	Zaps and Their Applications [My Copy] SIAM Journal on Computing, Vol. 36, No. 6. (2007), pp. 1513-1543. by Cynthia Dwork, Moni Naor posted to proofs witness-indistinguishable zap by rueckert on 2008-08-05 09:50:10 as
	Efficient Blind and Partially Blind Signatures Without Random Oracles [My Copy] Theory of Cryptography (2006), pp. 80-99. by Tatsuaki Okamoto posted to blind signature by rueckert on 2008-08-05 07:48:47 as

Note: You may cite this page as: http://www.citeulike.org/user/rueckert

Result page: 1 2 Next

lattice	17
blind	9
svp	8
signature	8
avarage-case	6
reduction	5
post-quantum	5
worst-case	5
hash-function	4
cvp	4
witness-indistinguishable	2
cryptosystem	2
zap	2
bilinear-maps	2
proofs	2
trapdoor	2
quantum	2
pairing	2
ves	1
hibe	1
generic-group-model	1
encryption	1
whitness-indistinguishable	1
rom	1
rom-free	1
zero-knowledge	1

rueckert's library 60 articles Export

rueckert's tags