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
76
search results - page 16 / 16
»
Confirmer Signature Schemes Secure against Adaptive Adversar...
Sort
relevance
views
votes
recent
update
View
thumb
title
35
click to vote
ASIACRYPT
2011
Springer
222
views
Cryptology
»
more
ASIACRYPT 2011
»
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
12 years 9 months ago
Download
ftp.inf.ethz.ch
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
claim paper
Read More »
« Prev
« First
page 16 / 16
Last »
Next »