Search results for "RSA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
41	Benoît Libert, Jean-Jacques Quisquater	Identity Based Undeniable Signatures.	CT-RSA	2004	DBLP DOI BibTeX RDF	provable security, pairings, undeniable signatures, ID-based cryptography
41	Colin D. Walter	Issues of Security with the Oswald-Aigner Exponentiation Algorithm.	CT-RSA	2004	DBLP DOI BibTeX RDF	Addition-subtraction chains, randomized exponentiation, elliptic curve cryptography, ECC, DPA, blinding, power analysis, smartcard, SPA, DEMA, point multiplication, SEMA
41	Philippe Golle, Markus Jakobsson, Ari Juels, Paul F. Syverson	Universal Re-encryption for Mixnets.	CT-RSA	2004	DBLP DOI BibTeX RDF
41	Shai Halevi, Phillip Rogaway	A Parallelizable Enciphering Mode.	CT-RSA	2004	DBLP DOI BibTeX RDF
41	Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung	A Generic Construction for Intrusion-Resilient Public-Key Encryption.	CT-RSA	2004	DBLP DOI BibTeX RDF
41	Marc Joye (eds.)	Topics in Cryptology - CT-RSA 2003, The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Lu Xiao 0003, Howard M. Heys	Hardware Performance Characterization of Block Cipher Structures.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung	Intrusion-Resilient Public-Key Encryption.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Seungjoo Kim, Masahiro Mambo, Yuliang Zheng 0001	Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption.	CT-RSA	2003	DBLP DOI BibTeX RDF	Kerckhoffs' assumption, provable security, chosen-ciphertext security
41	Mihir Bellare, Bennet S. Yee	Forward-Security in Private-Key Cryptography.	CT-RSA	2003	DBLP DOI BibTeX RDF	pseudorandom bit generators, message authentication, forward security, Symmetric cryptography, audit logs, proofs of security
41	Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, Joseph H. Silverman, William Whyte	NTRUSIGN: Digital Signatures Using the NTRU Lattice.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Douglas L. Whiting, Michael J. Sabin	Montgomery Prime Hashing for Message Authentication.	CT-RSA	2003	DBLP DOI BibTeX RDF	MAC, message authentication, Universal hash
41	Guido Bertoni, Jorge Guajardo, Sandeep S. Kumar, Gerardo Orlando, Christof Paar, Thomas J. Wollinger	Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery	Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.	CT-RSA	2003	DBLP DOI BibTeX RDF	elliptic curve arithmetic, Elliptic curve cryptosystem, scalar multiplication, pairing-based cryptosystem, ECM
41	Katsuyuki Okeya, Tsuyoshi Takagi	The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks.	CT-RSA	2003	DBLP DOI BibTeX RDF	width-w NAF, pre-computation table, smart card, side channel attacks, Elliptic curve cryptosystem, memory constraint
41	Huaxiong Wang, Josef Pieprzyk	Shared Generation of Pseudo-Random Functions with Cumulative Maps.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Nigel P. Smart	Access Control Using Pairing Based Cryptography.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo	Fractal Merkle Tree Representation and Traversal.	CT-RSA	2003	DBLP DOI BibTeX RDF	authentication, fractal, Merkle tree, Amortization
41	Nicolas T. Courtois, Jacques Patarin	About the XL Algorithm over GF(2).	CT-RSA	2003	DBLP DOI BibTeX RDF	MQ problem, overdefined and exactly defined systems of multivariate equations, Gröbner bases, XSL attacks on AES, XL algorithm, Multivariate quadratic equations
41	Thomas A. Berson	Cryptography after the Bubble: How to Make an Impact on the World.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Paolo D'Arco, Douglas R. Stinson	Fault Tolerant and DistributedBroadcast Encryption.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Jung-Yeun Lee, Jung Hee Cheon, Seungjoo Kim	An Analysis of Proxy Signatures: Is a Secure Channel Necessary?	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Dan Boneh, Ilya Mironov, Victor Shoup	A Secure Signature Scheme from Bilinear Maps.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Kaoru Kurosawa, Tetsu Iwata	TMAC: Two-Key CBC MAC.	CT-RSA	2003	DBLP DOI BibTeX RDF	block cipher, provable security, CBC MAC
41	Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin	Secure Applications of Pedersen's Distributed Key Generation Protocol.	CT-RSA	2003	DBLP DOI BibTeX RDF	distributed key generation, discrete logarithm, random oracle model, Threshold cryptography, exact security
41	Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen	Authenticated Data Structures for Graph and Geometric Searching.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Shouhuai Xu, Ravi S. Sandhu	Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Bodo Möller	Provably Secure Public-Key Encryptionfor Length-Preserving Chaumian Mixes.	CT-RSA	2003	DBLP DOI BibTeX RDF
41	Bart Preneel (eds.)	Topics in Cryptology - CT-RSA 2002, The Cryptographer's Track at the RSA Conference, 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Burton S. Kaliski Jr.	On Hash Function Firewalls in Signature Schemes.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, Moti Yung	Observability Analysis - Detecting When Improved Cryptosystems Fail.	CT-RSA	2002	DBLP DOI BibTeX RDF	robustness, cryptanalysis, implementations, side-channel attacks, observability, Security analysis, fault analysis, cryptosystems
41	Cheng-Fen Lu, Shiuh-Pyng Winston Shieh	Secure Key-Evolving Protocols for Discrete Logarithm Schemes.	CT-RSA	2002	DBLP DOI BibTeX RDF	Key-Evolving, Backward-Secrecy, Key Management, Forward-Secrecy
41	Greg Maitland, Colin Boyd	Co-operatively Formed Group Signatures.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Silvio Micali, Ronald L. Rivest	Transitive Signature Schemes.	CT-RSA	2002	DBLP DOI BibTeX RDF	graphs, digital signatures, public-key cryptography, transitive closure
41	John Black, Phillip Rogaway	Ciphers with Arbitrary Finite Domains.	CT-RSA	2002	DBLP DOI BibTeX RDF	Provable security, Modes of Operation, Symmetric Encryption, Ciphers
41	Atsuko Miyaji, Masao Nonaka, Yoshinori Takii	Known Plaintext Correlation Attack against RC5.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Lejla Batina, Geeke Muurling	Montgomery in Practice: How to Do It More Efficiently in Hardware.	CT-RSA	2002	DBLP DOI BibTeX RDF	scalability, performance model, systolic array, Montgomery multiplication, modular exponentiation
41	Colin D. Walter	MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis.	CT-RSA	2002	DBLP DOI BibTeX RDF	Mist exponentiation algorithm, division chains, smart card, DPA, blinding, power analysis, addition chains
41	Robert Johnson, David Molnar, Dawn Xiaodong Song, David A. Wagner 0001	Homomorphic Signature Schemes.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Johannes Wolkerstorfer, Elisabeth Oswald, Mario Lamberger	An ASIC Implementation of the AES SBoxes.	CT-RSA	2002	DBLP DOI BibTeX RDF	standard-cell design, scalability, Very Large Scale Integration (VLSI), pipelining, Advanced Encryption Standard (AES), Application Specific Integrated Circuit (ASIC), inversion, finite field arithmetic
41	Giuseppe Ateniese, Cristina Nita-Rotaru	Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Masayuki Abe	Securing "Encryption + Proof of Knowledge" in the Random Oracle Model.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Qi Cheng 0001, Shigenori Uchiyama	Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Silvio Micali, Ronald L. Rivest	Micropayments Revisited.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	Marc Fischlin	On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function.	CT-RSA	2002	DBLP DOI BibTeX RDF
41	David Naccache (eds.)	Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001, Proceedings	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Alfred Menezes, Minghua Qu	Analysis of the Weil Descent Attack of Gaudry, Hess and Smart.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Jean-Pierre Seifert	Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Yacov Yacobi	Improved Boneh-Shaw Content Fingerprinting.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Kris Gaj, Pawel Chodowiec	Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Elena Trichina, Alexander Tiountchik	Scalable Algorithm for Montgomery Multiplication and Its Implementation on the Coarse-Grain Reconfigurable Chip.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Ari Juels	Targeted Advertising ... And Privacy Too.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Amir Herzberg, Yosi Mass	Relying Party Credentials Framework.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Michael Brown, Darrel Hankerson, Julio César López-Hernández, Alfred Menezes	Software Implementation of the NIST Elliptic Curves Over Prime Fields.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Markus Jakobsson, Susanne Wetzel	Security Weaknesses in Bluetooth.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Paul Onions	On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Iris Anshel, Michael Anshel, Benji Fisher, Dorian Goldfeld	New Key Agreement Protocols in Braid Group Cryptography.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Detlef Hühnlein	Faster Generation of NICE-Schnorr-Type Signatures.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Alexander Tiountchik, Elena Trichina	Modular Exponentiation on Fine-Grained FPGA.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Philippe Golle, Ilya Mironov	Uncheatable Distributed Computations.	CT-RSA	2001	DBLP DOI BibTeX RDF	Magic numbers, Ringers, Distributed computing
41	Eyal Kushilevitz, Tal Rabin	Fair e-Lotteries and e-Casinos.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Yuji Watanabe, Goichiro Hanaoka, Hideki Imai	Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Markus Jakobsson, David Pointcheval, Adam L. Young	Secure Mobile Gambling.	CT-RSA	2001	DBLP DOI BibTeX RDF	Merkle, publicly verifiable, robust, Fair, lightweight, gambling
41	Marc Fischlin	A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Daniel R. L. Brown, Don B. Johnson	Formal Security Proofs for a Signature Scheme with Partial Message Recovery.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Marc Joye, Jean-Jacques Quisquater, Moti Yung	On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Michel Abdalla, Mihir Bellare, Phillip Rogaway	The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES.	CT-RSA	2001	DBLP DOI BibTeX RDF	Cryptographic standards, Diffie-Hellman key exchange, provable security, elliptic curve cryptosystems, generic model, ElGamal encryption
41	Helena Handschuh, Lars R. Knudsen, Matthew J. B. Robshaw	Analysis of SHA-1 in Encryption Mode.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Jacques Patarin, Nicolas T. Courtois, Louis Goubin	FLASH, a Fast Multivariate Signature Algorithm.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Michel Abdalla, Sara K. Miner, Chanathip Namprempre	Forward-Secure Threshold Signature Schemes.	CT-RSA	2001	DBLP DOI BibTeX RDF	proactive cryptography, forward security, threshold cryptography, signature schemes
41	David P. Jablon	Password Authentication Using Multiple Servers.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Philip D. MacKenzie	More Efficient Password-Authenticated Key Exchange.	CT-RSA	2001	DBLP DOI BibTeX RDF
41	Yoshinori Aono	A New Lattice Construction for Partial Key Exposure Attack for RSA.	Public Key Cryptography	2009	DBLP DOI BibTeX RDF	partial key exposure attack, the Coppersmith technique, cryptanalysis, RSA, lattice basis reduction
41	Abderrahmane Nitaj	Cryptanalysis of RSA Using the Ratio of the Primes.	AFRICACRYPT	2009	DBLP DOI BibTeX RDF	Coppersmith’s Method, Cryptanalysis, RSA, Factorization, Continued Fraction
41	Jean-Sébastien Coron, Antoine Joux, Ilya Kizhvatov, David Naccache, Pascal Paillier	Fault Attacks on RSA Signatures with Partially Unknown Messages.	CHES	2009	DBLP DOI BibTeX RDF	Coppersmith’s theorem, iso/iec 9796-2, digital signatures, rsa, Fault attacks
41	Martin Hlavác	Known-Plaintext-Only Attack on RSA-CRT with Montgomery Multiplication.	CHES	2009	DBLP DOI BibTeX RDF	Montgomery exponentiation, electronic passport, RSA, side channel attack, Chinese Remainder Theorem, Hidden Number Problem
41	Santanu Sarkar 0001, Subhamoy Maitra	Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors.	ICISC	2008	DBLP DOI BibTeX RDF	Cryptanalysis, RSA, Side Channel Attacks, Lattice, Factorization, LLL Algorithm, Weak Keys
41	Alexandre Berzati, Cécile Canovas, Louis Goubin	Perturbating RSA Public Keys: An Improved Attack.	CHES	2008	DBLP DOI BibTeX RDF	RSA, public key, fault attacks, DFA
41	David Vigilant	RSA with CRT: A New Cost-Effective Solution to Thwart Fault Attacks.	CHES	2008	DBLP DOI BibTeX RDF	Software countermeasure, RSA, Chinese Remainder Theorem, Fault attacks, Modular exponentiation, Bellcore attack
41	Arnaud Boscher, Robert Naciri, Emmanuel Prouff	CRT RSA Algorithm Protected Against Fault Attacks.	WISTP	2007	DBLP DOI BibTeX RDF	Smart Card, RSA, Chinese Remainder Theorem, Fault Attacks, Simple Power Analysis, Modular Exponentiation
41	Ellen Jochemsz, Alexander May 0001	A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073.	CRYPTO	2007	DBLP DOI BibTeX RDF	small exponents, Coppersmith’s method, cryptanalysis, RSA, CRT
41	Ellen Jochemsz, Benne de Weger	A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice.	ISC	2006	DBLP DOI BibTeX RDF	partial key exposure, inhomogeneous diophantine approximation, cryptanalysis, RSA, lattice basis reduction
41	Wen-Chung Kuo, Ming-Yang Chen	A Modified (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem.	ICITA (2)	2005	DBLP DOI BibTeX RDF	RSA, Secret Sharing, Proxy Signature
41	Ryotaro Hayashi 0001, Keisuke Tanaka	The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity.	Public Key Cryptography	2005	DBLP DOI BibTeX RDF	undeniable and confirmer signature, anonymity, encryption, RSA, ring signature
41	Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko	The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme.	J. Cryptol.	2003	DBLP DOI BibTeX RDF	Blind digital signature schemes, RSA, Digital cash
41	Mihir Bellare, Gregory Neven	Transitive Signatures Based on Factoring and RSA.	ASIACRYPT	2002	DBLP DOI BibTeX RDF	transitive signatures, RSA, Signatures
41	Alexander May 0001	Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.	CRYPTO	2002	DBLP DOI BibTeX RDF	Coppersmith's method, small secret exponent, RSA, lattice reduction
41	Dan Boneh, Matthew K. Franklin	Efficient generation of shared RSA keys.	J. ACM	2001	DBLP DOI BibTeX RDF	RSA, threshold cryptography, Multiparty computation, primality testing
41	Yuliang Zheng 0001	Identification, Signature and Signcryption Using High Order Residues Modulo an RSA Composite.	Public Key Cryptography	2001	DBLP DOI BibTeX RDF	High Order Residues, RSA, Signature, Public Key Encryption, Signcryption
41	Ronald Cramer, Victor Shoup	Signature schemes based on the strong RSA assumption.	ACM Trans. Inf. Syst. Secur.	2000	DBLP DOI BibTeX RDF	digital signatures, RSA, provable security
41	Werner Schindler	A Timing Attack against RSA with the Chinese Remainder Theorem.	CHES	2000	DBLP DOI BibTeX RDF	RSA, Chinese Remainder Theorem, Montgomery multiplication, Timing attack
40	Emmanuelle Dottax, Christophe Giraud 0001, Matthieu Rivain, Yannick Sierra	On Second-Order Fault Analysis Resistance for CRT-RSA Implementations.	WISTP	2009	DBLP DOI BibTeX RDF	Second Order, CRT-RSA, Fault Attacks, Countermeasure
40	Mahabir Prasad Jhanwar, Rana Barua	Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree.	INDOCRYPT	2009	DBLP DOI BibTeX RDF	RSA Group, Free Group, Quadratic Residues
40	Jesús F. Almansa, Ivan Damgård, Jesper Buus Nielsen	Simplified Threshold RSA with Adaptive and Proactive Security.	EUROCRYPT	2006	DBLP DOI BibTeX RDF	Threshold RSA, Uni-versal Composability, Proactiveness, Adaptive Security
40	Johannes Blömer, Martin Otto 0002	Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered.	FDTC	2006	DBLP DOI BibTeX RDF	CRT-RSA, BOS-Scheme, Wagner’s attack, smartcards, fault attacks
40	Johan Håstad, Mats Näslund	The security of all RSA and discrete log bits.	J. ACM	2004	DBLP DOI BibTeX RDF	RSA-encryption, bit-security, complexity, Cryptography, discrete logarithms
40	Huafei Zhu	Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF	Committed signatures, strong RSA assumption, fair exchange protocols
40	Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James P. Hughes 0001, Paul C. Leyland	Factoring Estimates for a 1024-Bit RSA Modulus.	ASIACRYPT	2003	DBLP DOI BibTeX RDF	1024-bit RSA, TWIRL, factorization, number field sieve
40	Kaoru Kurosawa, Tsuyoshi Takagi	Some RSA-Based Encryption Schemes with Tight Security Reduction.	ASIACRYPT	2003	DBLP DOI BibTeX RDF	RSA-Paillier, Rabin-Paillier, Factoring, semantic security, tight reduction
40	Jung-Min Park 0001, Edwin K. P. Chong, Howard Jay Siegel	Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures.	PODC	2003	DBLP DOI BibTeX RDF	e-commerce, zero-knowledge proofs, multisignatures, RSA signatures, Fair-exchange protocols