Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
283
search results - page 13 / 57
»
Bi-Deniable Public-Key Encryption
Sort
relevance
views
votes
recent
update
View
thumb
title
57
click to vote
ECCC
2007
127
views
more
ECCC 2007
»
Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code
14 years 9 months ago
Download
www-personal.umich.edu
Brett Hemenway, Rafail Ostrovsky
claim paper
Read More »
43
click to vote
TISSEC
2008
77
views
more
TISSEC 2008
»
Provably Secure Timed-Release Public Key Encryption
14 years 9 months ago
Download
www-users.cs.umn.edu
Jung Hee Cheon, Nicholas Hopper, Yongdae Kim, Ivan...
claim paper
Read More »
69
click to vote
AFRICACRYPT
2010
Springer
129
views
Cryptology
»
more
AFRICACRYPT 2010
»
Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions
14 years 8 months ago
Download
www.manulis.eu
David Galindo, Benoît Libert, Marc Fischlin,...
claim paper
Read More »
62
click to vote
SCN
2010
Springer
113
views
Communications
»
more
SCN 2010
»
Public-Key Encryption with Efficient Amortized Updates
14 years 7 months ago
Download
www.cs.ucla.edu
Nishanth Chandran, Rafail Ostrovsky, William E. Sk...
claim paper
Read More »
81
click to vote
TCC
2010
Springer
170
views
Cryptology
»
more
TCC 2010
»
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
15 years 6 months ago
Download
eprint.iacr.org
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
claim paper
Read More »
« Prev
« First
page 13 / 57
Last »
Next »