849 search results - page 83 / 170 » Completely Non-malleable Schemes |
120
Voted
EUROCRYPT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
83
Voted
NSDI
2004
15 years 2 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
107
Voted
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
103
click to vote
IACR
2011
14 years 7 days ago
2011
Norway is going to experience an Internet voting scheme in September 2011 for local governmental elections, targeting a comprehensive Internet voting system in 2017 for national el...
93
Voted
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...