Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2024
Frustum Volume Caching for Accelerated NeRF Rendering
Proceedings of the ACM on Computer Graphics and Interactive Techniques (PACMCGIT), Volume 7, Issue 3Article No.: 39, Pages 1–22https://doi.org/10.1145/3675370Neural Radiance Fields (NeRFs) have revolutionized the field of inverse rendering due to their ability to synthesize high-quality novel views and applicability in practical contexts. NeRFs leverage volume rendering, evaluating view-dependent color at ...
- research-articleJuly 2024
StopThePop: Sorted Gaussian Splatting for View-Consistent Real-time Rendering
ACM Transactions on Graphics (TOG), Volume 43, Issue 4Article No.: 64, Pages 1–17https://doi.org/10.1145/3658187Gaussian Splatting has emerged as a prominent model for constructing 3D representations from images across diverse domains. However, the efficiency of the 3D Gaussian Splatting rendering pipeline relies on several simplifications. Notably, reducing ...
- research-articleNovember 2023
High-precision RNS-CKKS on fixed but smaller word-size architectures: theory and application
- Rashmi Agrawal,
- Jung Ho Ahn,
- Flavio Bergamaschi,
- Ro Cammarota,
- Jung Hee Cheon,
- Fillipe D. M. de Souza,
- Huijing Gong,
- Minsik Kang,
- Duhyeong Kim,
- Jongmin Kim,
- Hubert de Lassus,
- Jai Hyun Park,
- Michael Steiner,
- Wen Wang
WAHC '23: Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic CryptographyPages 23–34https://doi.org/10.1145/3605759.3625257A prevalent issue in the residue number system (RNS) variant of the Cheon-Kim-Kim-Song (CKKS) homomorphic encryption (HE) scheme is the challenge of efficiently achieving high precision on hardware architectures with a fixed, yet smaller, word-size of ...
- research-articleNovember 2019
S-FaaS: Trustworthy and Accountable Function-as-a-Service using Intel SGX
CCSW'19: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security WorkshopPages 185–199https://doi.org/10.1145/3338466.3358916Function-as-a-Service (FaaS) is a recent and popular cloud computing paradigm in which the function provider specifies a function to be run and is billed only for the computational resources used by that function. Compared to other cloud paradigms, FaaS ...
- ArticleAugust 2019
VRASED: a verified hardware/software co-design for remote attestation
Remote Attestation (RA) is a distinct security service that allows a trusted verifier (Vrf) to measure the software state of an untrusted remote prover (Prv). If correctly implemented, RA allows V rf to remotely detect if Prv is in an illegal or ...
-
- research-articleOctober 2018
Enhancing Stanford Design Thinking for Kids with Digital Technologies A Participatory Action Research Approach to Challenge-Based Learning
Can digital competencies be acquired by solving real problems? The educational intervention MadeByKids called an external educational provider to 17 schools to conduct a series of workshops, having pupils age 7 – 12 solve challenges such as ...
- research-articleNovember 2013
Outsourced symmetric private information retrieval
CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications securityPages 875–888https://doi.org/10.1145/2508859.2516730In the setting of searchable symmetric encryption (SSE), a data owner D outsources a database (or document/file collection) to a remote server E in encrypted form such that D can later search the collection at E while hiding information about the ...
- ArticleJuly 2013
Influence of monetary and non-monetary incentives on students' behavior in blended learning settings in higher education
OCSC'13: Proceedings of the 5th international conference on Online Communities and Social ComputingPages 104–112https://doi.org/10.1007/978-3-642-39371-6_12Previous research shows that blended learning has the ability to increase the learners' motivation and learning success. However, motivational aspects in blended learning have not been sufficiently researched yet. We therefore investigated the influence ...
- ArticleJune 2011
Composable security analysis of OS services
ACNS'11: Proceedings of the 9th international conference on Applied cryptography and network securityPages 431–448We provide an analytical framework for basic integrity properties of file systems, namely the binding of files to filenames and writing capabilities. A salient feature of our modeling and analysis is that it is composable: In spite of the fact that we ...
- ArticleApril 2010
Designing a side channel resistant random number generator
- Suresh N. Chari,
- Vincenzo V. Diluoffo,
- Paul A. Karger,
- Elaine R. Palmer,
- Tal Rabin,
- Josyula R. Rao,
- Pankaj Rohotgi,
- Helmut Scherzer,
- Michael Steiner,
- David C. Toll
CARDIS'10: Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced ApplicationPages 49–64https://doi.org/10.1007/978-3-642-12510-2_5This paper describes the design of the random number generator (RNG) in the Caernarvon high assurance smart card operating system. Since it is used in the generation of cryptographic keys and other sensitive materials, the RNG has a number of stringent ...
- ArticleSeptember 2009
Risks of the CardSpace Protocol
ISC '09: Proceedings of the 12th International Conference on Information SecurityPages 278–293https://doi.org/10.1007/978-3-642-04474-8_23Microsoft has designed a user-centric identity metasystem encompassing a suite of various protocols for identity management. CardSpace is based on open standards, so that various applications can make use of the identity metasystem, including, for ...
- research-articleApril 2008
SMash: secure component model for cross-domain mashups on unmodified browsers
WWW '08: Proceedings of the 17th international conference on World Wide WebPages 535–544https://doi.org/10.1145/1367497.1367570Mashup applications mix and merge content (data and code) from multiple content providers in a user's browser, to provide high-value web applications that can rival the user experience provided by desktop applications. Current browser security models ...
- research-articleSeptember 2006
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications (JSAC), Volume 18, Issue 4Pages 628–639https://doi.org/10.1109/49.839937Many modern computing environments involve dynamic peer groups. Distributed simulation, multiuser games, conferencing applications, and replicated servers are just a few examples. Given the openness of today's networks, communication among peers (group ...
- research-articleSeptember 2006
Design, implementation, and deployment of the iKP secure electronic payment system
- M. Bellare,
- J. A. Garay,
- R. Hauser,
- A. Herzberg,
- H. Krawczyk,
- M. Steiner,
- G. Tsudik,
- E. Van Herreweghen,
- M. Waidner
IEEE Journal on Selected Areas in Communications (JSAC), Volume 18, Issue 4Pages 611–627https://doi.org/10.1109/49.839936This paper discusses the design, implementation, and deployment of a secure and practical payment system for electronic commerce on the Internet. The system is based on the iKP family of protocols-(i=1,2,3)-developed at IBM Research. The protocols ...
- ArticleAugust 2006
Mitigating dictionary attacks on password-protected local storage
CRYPTO'06: Proceedings of the 26th annual international conference on Advances in CryptologyPages 160–179https://doi.org/10.1007/11818175_10We address the issue of encrypting data in local storage using a key that is derived from the user's password. The typical solution in use today is to derive the key from the password using a cryptographic hash function. This solution provides ...
- ArticleFebruary 2005
A privacy-protecting coupon system
FC'05: Proceedings of the 9th international conference on Financial Cryptography and Data SecurityPages 93–108https://doi.org/10.1007/11507840_12A coupon represents the right to claim some service which is typically offered by vendors. In practice, issuing bundled multi-coupons is more efficient than issuing single coupons separately. The diversity of interests of the parties involved in a ...
- ArticleFebruary 2005
Hardness amplification of weakly verifiable puzzles
TCC'05: Proceedings of the Second international conference on Theory of CryptographyPages 17–33https://doi.org/10.1007/978-3-540-30576-7_2Is it harder to solve many puzzles than it is to solve just one? This question has different answers, depending on how you define puzzles. For the case of inverting one-way functions it was shown by Yao that solving many independent instances ...
- articleMay 2004
Polynomial liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios, these properties depend on the scheduler, which is usually considered to be fair in this case. The standard ...
- ArticleDecember 2002
Manufacturing 2: creation of a self adaptive simulation for Radex Heraklit industries
WSC '02: Proceedings of the 34th conference on Winter simulation: exploring new frontiersPages 1026–1029The main goal of this project was to create a simulation of the production plant of Radex Heralkit Industries (RHI) that offers the possibility to change the structure of the model by adding machines and furnaces and change system parameters. The large ...
- ArticleJune 2002
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on the scheduler, which is usually considered to be fair in this case. ...